Pages that link to "Item:Q2251549"
From MaRDI portal
The following pages link to Multi-objective integer programming: an improved recursive algorithm (Q2251549):
Displayed 21 items.
- MOIP_AIRA (Q43588) (← links)
- A cutting plane approach for multi-objective integer indefinite quadratic programming problem (Q260685) (← links)
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics (Q301311) (← links)
- An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
- Multiobjective optimization for multimode transportation problems (Q721075) (← links)
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
- An interactive approximation algorithm for multi-objective integer programs (Q1652656) (← links)
- An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (Q1734819) (← links)
- Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program (Q1753509) (← links)
- Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
- Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems (Q2274869) (← links)
- An extension of the non-inferior set estimation algorithm for many objectives (Q2301933) (← links)
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
- An exact method to generate all nondominated spanning trees (Q2954355) (← links)