Approximating biobjective minimization problems using general ordering cones
From MaRDI portal
Publication:6162511
DOI10.1007/s10898-023-01276-xzbMath1519.90219arXiv2109.10067OpenAlexW3201546393MaRDI QIDQ6162511
Arne Herzel, Stephan Helfrich, Stefan Ruzika, Clemens Thielen
Publication date: 28 June 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.10067
Cites Work
- Unnamed Item
- Covers and approximations in multiobjective optimization
- Approximately dominating representatives
- Relative importance of criteria in multiobjective programming: a cone-based approach
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- One-exact approximate Pareto sets
- The power of the weighted sum scalarization for approximating multiobjective optimization problems
- A general approximation method for bicriteria minimization problems
- Cone characterizations of approximate solutions in real vector optimization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Efficiently computing succinct trade-off curves
- How Good is the Chord Algorithm?
- Vector Optimization Problems and Their Solution Concepts
- Recent Developments in Vector Optimization
- Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
- Approximability and Hardness in Multi-objective Optimization
- Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
- Relative importance of criteria: a quantitative approach
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Multicriteria Optimization
This page was built for publication: Approximating biobjective minimization problems using general ordering cones
