Generating equidistant representations in biobjective programming
From MaRDI portal
Recommendations
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
- On the quality of discrete representations in multiple objective programming
- Representation of the non-dominated set in biobjective discrete optimization
- Bilevel programming for generating discrete representations in multiobjective optimization
- Equispaced Pareto front construction for constrained bi-objective optimization
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 978735 (Why is no real title available?)
- scientific article; zbMATH DE number 219844 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- A complementarity constraint formulation of convex multiobjective optimization problems
- A constraint method in nonlinear multi-objective optimization
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
- Algorithm robust for the bicriteria discrete optimization problem
- An Adaptive Scalarization Method in Multiobjective Optimization
- An algorithm for optimizing over the weakly-efficient set
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Approximation methods in multiobjective programming
- Diversity Maximization Approach for Multiobjective Optimization
- Finding representative systems for discrete bicriterion optimization problems
- Gap-free computation of Pareto-points by quadratic scalarizations
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Generating a representative subset of the nondominated frontier in multiple criteria decision making
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Introduction to the Theory of Nonlinear Optimization
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multiobjective search algorithm with subdivision technique
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On a constructive approximation of the efficient outcomes in bicriterion vector optimization
- On the Structure of the Non-dominated Set for Bicriteria Programmes
- On the quality of discrete representations in multiple objective programming
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Practical bilevel optimization. Algorithms and applications
- Reference point approximation method for the solution of bicriterial nonlinear optimization problems
- Relative importance of criteria: a quantitative approach
- Scalarizing vector optimization problems
- Search for efficient solutions of multi-criteria problems by target-level method
- Solving multiobjective programming problems by discrete representation
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- The structure of admissible points with respect to cone dominance
- Towards finding global representations of the efficient set in multiple objective mathematical programming
Cited in
(5)- Equispaced Pareto front construction for constrained bi-objective optimization
- Discrete representation of non-dominated sets in multi-objective linear programming
- Bilevel programming for generating discrete representations in multiobjective optimization
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
- Quadratic scalarization for decomposed multiobjective optimization
This page was built for publication: Generating equidistant representations in biobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429518)
