A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
From MaRDI portal
Publication:513166
DOI10.1007/s10898-016-0425-5zbMath1366.90190OpenAlexW2321437985MaRDI QIDQ513166
Publication date: 3 March 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/3911
approximationefficient solutionmultiple objective optimizationcoverage errorbox-algorithmrepresentation systems
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(L\)-shape search method for triobjective integer programming
- Branch and bound algorithms for the bus evacuation problem
- A robust bus evacuation model with delayed scenario information
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Nonlinear multiobjective optimization
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- Finding representative systems for discrete bicriterion optimization problems
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Approximation methods in multiobjective programming
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Multicriteria Optimization
- The Triangle Splitting Method for Biobjective Mixed Integer Programming
This page was built for publication: A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
