The following pages link to (Q3802899):
Displaying 40 items.
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (Q336792) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
- Bi-objective matchings with the triangle inequality (Q515541) (← links)
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems (Q519093) (← links)
- A hybrid method for solving the multi-objective assignment problem (Q656068) (← links)
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
- A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
- Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems (Q709108) (← links)
- A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
- A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- On bicriterion minimal spanning trees: An approximation (Q1360130) (← links)
- Analysis of FPTASes for the multi-objective shortest path problem (Q1652052) (← links)
- Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
- Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606) (← links)
- A relation of dominance for the bicriterion bus routing problem (Q2012147) (← links)
- Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions (Q2224924) (← links)
- The time-dependent vehicle routing problem with time windows and road-network information (Q2226499) (← links)
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach (Q2239941) (← links)
- On efficiency of a single variable bi-objective optimization algorithm (Q2300650) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- Dynamic programming and minimum risk paths (Q2432847) (← links)
- Speeding up Martins' algorithm for multiple objective shortest path problems (Q2441362) (← links)
- Two phase algorithms for the bi-objective assignment problem (Q2455615) (← links)
- An exact method for the biobjective shortest path problem for large-scale road networks (Q2630225) (← links)
- An improved multiobjective shortest path algorithm (Q2669519) (← links)
- Computing representations using hypervolume scalarizations (Q2669609) (← links)
- Simple and efficient bi-objective search algorithms via fast dominance checks (Q2680770) (← links)
- Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis (Q3649591) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem (Q5084630) (← links)
- Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
- Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
- Ordinal optimization through multi-objective reformulation (Q6096566) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
- The Steiner bi-objective shortest path problem (Q6114902) (← links)
