Discrete representation of non-dominated sets in multi-objective linear programming
From MaRDI portal
Recommendations
- Representation of the non-dominated set in biobjective discrete optimization
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
- On the quality of discrete representations in multiple objective programming
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
Cites work
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
- A modified NBI and NC method for the solution of \(N\)-multiobjective optimization problems
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Approximation methods in multiobjective programming
- Approximation of geometric dispersion problems
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- Generating equidistant representations in biobjective programming
- Global and well-distributed Pareto frontier by modified normalized normal constraint methods for bicriterion problems
- Mathematical optimization in intensity modulated radiation therapy
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multicriteria Optimization
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Novel insights for multi-objective optimisation in engineering using normal boundary intersection and (enhanced) normalised normal constraint
- On finding representative non-dominated points for bi-objective integer network flow problems
- On the quality of discrete representations in multiple objective programming
- Representation of the non-dominated set in biobjective discrete optimization
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
- The normalized normal constraint method for generating the Pareto frontier
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Towards finding global representations of the efficient set in multiple objective mathematical programming
Cited in
(15)- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- scientific article; zbMATH DE number 1071795 (Why is no real title available?)
- Representing the nondominated set in multi-objective mixed-integer programs
- Multi-criteria optimization and decision-making in radiotherapy
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
- On the quality of discrete representations in multiple objective programming
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
- Bilevel programming for generating discrete representations in multiobjective optimization
- A reference point-based evolutionary algorithm for approximating regions of interest in multiobjective problems
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- Advancements in the computation of enclosures for multi-objective optimization problems
- Finding a representative nondominated set for multi-objective mixed integer programs
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
This page was built for publication: Discrete representation of non-dominated sets in multi-objective linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751259)
