Pages that link to "Item:Q4896386"
From MaRDI portal
The following pages link to Multi‐objective combinatorial optimization problems: A survey (Q4896386):
Displaying 50 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem (Q319360) (← links)
- Resource allocation in multi-class dynamic PERT networks with finite capacity (Q320114) (← links)
- Multiobjective vehicle routing problem with fixed delivery and optional collections (Q375980) (← links)
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
- A review of multiobjective programming and its application in quantitative psychology (Q645494) (← links)
- The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives (Q651306) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming (Q814696) (← links)
- The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study (Q833551) (← links)
- Multiple objective minimum cost flow problems: a review (Q853016) (← links)
- Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study (Q853072) (← links)
- A biobjective method for sample allocation in stratified sampling (Q856297) (← links)
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
- Multiple criteria facility location problems: a survey (Q988401) (← links)
- Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS (Q1265848) (← links)
- The multiscenario lot size problem with concave costs. (Q1426700) (← links)
- An interactive heuristic method for multi-objective combinatorial optimization (Q1569903) (← links)
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite (Q1598722) (← links)
- Analysis of FPTASes for the multi-objective shortest path problem (Q1652052) (← links)
- A tolerance function for the multiobjective set covering problem (Q1733317) (← links)
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs (Q1827646) (← links)
- Multiobjective solution of the uncapacitated plant location problem (Q1869487) (← links)
- A fuzzy genetic algorithm for driver scheduling (Q1869717) (← links)
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
- Using metaheuristics in multiobjective resource constrained project scheduling (Q1969837) (← links)
- Application of complex networks theory in urban traffic network researches (Q2005914) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- Advancing local search approximations for multiobjective combinatorial optimization problems (Q2125231) (← links)
- What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization (Q2147143) (← links)
- Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
- Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion (Q2189877) (← links)
- On preprocessing for weighted MaxSAT (Q2234104) (← links)
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157) (← links)
- Relationships between Pareto optimality in multi-objective 0-1 linear programming and DEA efficiency (Q2371350) (← links)
- Preface. Multiobjective discrete and combinatorial optimization (MODCO) (Q2379861) (← links)
- Multi-criteria assignment problem with incompatibility and capacity constraints (Q2379877) (← links)
- Estimating the number of basins of attraction of multi-objective combinatorial problems (Q2424731) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← links)
- Optimizing a linear function over an integer efficient set (Q2503083) (← links)
- Cutting plane method for multiple objective stochastic integer linear programming (Q2569084) (← links)
- Multi-objective tabu search using a multinomial probability mass function (Q2572860) (← links)
