Finding a representative nondominated set for multi-objective mixed integer programs
From MaRDI portal
Recommendations
- Representing the nondominated set in multi-objective mixed-integer programs
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Finding all nondominated points of multi-objective integer programs
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Discrete representation of non-dominated sets in multi-objective linear programming
- Distribution based representative sets for multi-objective integer programs
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- scientific article; zbMATH DE number 3936958
- Re. ``Discrete representation of non-dominated sets in multi-objective linear programming
- Finding non dominated points for multiobjective integer convex programs with linear constraints
Cites work
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- A heuristic approach to bicriteria scheduling
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A visual interactive method for solving the multiple criteria problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Diversity Maximization Approach for Multiobjective Optimization
- Finding all nondominated points of multi-objective integer programs
- Generating a representative subset of the nondominated frontier in multiple criteria decision making
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Multi-objective integer programming: an improved recursive algorithm
- On the representation of the search region in multi-objective optimization
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- The \(L\)-shape search method for triobjective integer programming
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- Two phase algorithms for the bi-objective assignment problem
- K-PPM: a new exact method to solve multi-objective combinatorial optimization problems
Cited in
(17)- New -constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- Distribution based representative sets for multi-objective integer programs
- A method to identify a representation of the set of non-dominated points for discrete tri-objective optimization problems
- An efficient solver for large-scale onshore wind farm siting including cable routing
- How to select a small set of diverse solutions to mixed integer programming problems
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- An extension of the non-inferior set estimation algorithm for many objectives
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A criterion space decomposition approach to generalized tri-objective tactical resource allocation
- Fifty years of multi-objective optimization and decision-making: from mathematical programming to evolutionary computation
- Solution approaches for equitable multiobjective integer programming problems
- An approximation algorithm for multiobjective mixed-integer convex optimization
- Split algorithms for multiobjective integer programming problems
- Effective anytime algorithm for multiobjective combinatorial optimization problems
- Representing the nondominated set in multi-objective mixed-integer programs
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
- An exact algorithm for biobjective integer programming problems
This page was built for publication: Finding a representative nondominated set for multi-objective mixed integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991106)
