Representing the nondominated set in multi-objective mixed-integer programs
From MaRDI portal
Publication:2242330
DOI10.1016/j.ejor.2021.04.005zbMath1490.90267OpenAlexW3156529534MaRDI QIDQ2242330
Ilgın Doğan, Banu Lokman, Murat M. Köksalan
Publication date: 9 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.04.005
Related Items (1)
Cites Work
- Unnamed Item
- The \(L\)-shape search method for triobjective integer programming
- On the representation of the search region in multi-objective optimization
- Representation of the non-dominated set in biobjective discrete optimization
- On the quality of discrete representations in multiple objective programming
- Finding all nondominated points of multi-objective integer programs
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Discrete representation of non-dominated sets in multi-objective linear programming
- Efficient computation of the search region in multi-objective optimization
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- Finding a representative nondominated set for multi-objective mixed integer programs
- Distribution based representative sets for multi-objective integer programs
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Finding nadir points in multi-objective integer programs
- Computing the nadir point for multiobjective discrete optimization problems
- Finding representative systems for discrete bicriterion optimization problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Diversity Maximization Approach for Multiobjective Optimization
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- Efficient Colored Orthogonal Range Counting
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- A heuristic approach to bicriteria scheduling
- Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making
- Multicriteria Optimization
This page was built for publication: Representing the nondominated set in multi-objective mixed-integer programs
