New -constraint methods for multi-objective integer linear programming: a Pareto front representation approach
From MaRDI portal
(Redirected from Publication:2106743)
Recommendations
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Finding a representative nondominated set for multi-objective mixed integer programs
- A method for generating a well-distributed Pareto set in multiple objective mixed integer linear programs based on the decision maker's initial aspiration level
- Representing the nondominated set in multi-objective mixed-integer programs
- On the quality of discrete representations in multiple objective programming
Cites work
- scientific article; zbMATH DE number 5917374 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 2159088 (Why is no real title available?)
- 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 review of interactive methods for multiobjective integer and mixed-integer programming
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- An algorithm for the bi-criterion integer programming problem
- An algorithm for the multiple objective integer linear programming problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An exact method for computing the nadir values in multiple objective linear programming
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Computing the nadir point for multiobjective discrete optimization problems
- Discrete representation of non-dominated sets in multi-objective linear programming
- Diversity Maximization Approach for Multiobjective Optimization
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Efficient computation of the search region in multi-objective optimization
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
- Finding a representative nondominated set for multi-objective mixed integer programs
- Improved -constraint method for multiobjective programming
- 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
- Multicriteria Optimization
- Multiobjective optimization. Interactive and evolutionary approaches
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- On finding representative non-dominated points for bi-objective integer network flow problems
- On the quality of discrete representations in multiple objective programming
- On the representation of the search region in multi-objective optimization
- Performance indicators in multiobjective optimization
- Representing the nondominated set in multi-objective mixed-integer programs
- Statistical Analysis of Computational Tests of Algorithms and Heuristics
Cited in
(4)- An efficient solver for large-scale onshore wind farm siting including cable routing
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- New $\epsilon$-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
This page was built for publication: New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106743)
