Pages that link to "Item:Q2342947"
From MaRDI portal
The following pages link to A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947):
Displayed 32 items.
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- On the representation of the search region in multi-objective optimization (Q319674) (← links)
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
- Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
- A box decomposition algorithm to compute the hypervolume indicator (Q1652179) (← links)
- An interactive approximation algorithm for multi-objective integer programs (Q1652656) (← links)
- Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
- Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
- A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs (Q2005902) (← links)
- Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects (Q2040606) (← links)
- Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
- An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
- Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
- Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems (Q2274869) (← links)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
- Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
- Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
- Multiobjective Integer Programming: Synergistic Parallel Approaches (Q3386777) (← links)
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems (Q5055294) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Monomial Tropical Cones for Multicriteria Optimization (Q5112824) (← links)
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming (Q5137441) (← links)
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs (Q5139635) (← links)
- Comments on: ``Static and dynamic source locations in undirected networks'' (Q5966288) (← links)
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)
- A criterion space decomposition approach to generalized tri-objective tactical resource allocation (Q6067194) (← links)
- Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)
- Optimizing a linear function over the nondominated set of multiobjective integer programs (Q6091884) (← links)
- Outer approximation algorithms for convex vector optimization problems (Q6113528) (← links)