Finding a representative nondominated set for multi-objective mixed integer programs
From MaRDI portal
Publication:1991106
DOI10.1016/j.ejor.2018.06.012zbMath1403.90522OpenAlexW2810943498WikidataQ129576593 ScholiaQ129576593MaRDI QIDQ1991106
Banu Lokman, Gökhan Ceyhan, Murat M. Köksalan
Publication date: 30 October 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.06.012
Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items (10)
Solution approaches for equitable multiobjective integer programming problems ⋮ Distribution based representative sets for multi-objective integer programs ⋮ An exact algorithm for biobjective integer programming problems ⋮ Split algorithms for multiobjective integer programming problems ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ A criterion space decomposition approach to generalized tri-objective tactical resource allocation ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ An extension of the non-inferior set estimation algorithm for many objectives ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
Uses Software
Cites Work
- The \(L\)-shape search method for triobjective integer programming
- On the representation of the search region in multi-objective optimization
- Finding all nondominated points of multi-objective integer programs
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- A visual interactive method for solving the multiple criteria problem
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A survey and annotated bibliography of multiobjective combinatorial optimization
- 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
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- Two phase algorithms for the bi-objective assignment problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Diversity Maximization Approach for Multiobjective Optimization
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- 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
This page was built for publication: Finding a representative nondominated set for multi-objective mixed integer programs
