Approximation Methods for Multiobjective Optimization Problems: A Survey
From MaRDI portal
Publication:5084597
DOI10.1287/ijoc.2020.1028OpenAlexW3128852614MaRDI QIDQ5084597
Arne Herzel, Clemens Thielen, Stefan Ruzika
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1028
Related Items (9)
An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization ⋮ Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ Obtaining approximately optimal and diverse solutions via dispersion ⋮ Approximating biobjective minimization problems using general ordering cones ⋮ Exact and approximate determination of the Pareto front using minimal correction subsets ⋮ Faster algorithms for bicriteria scheduling of identical jobs on uniform machines ⋮ The power of the weighted sum scalarization for approximating multiobjective optimization problems ⋮ An approximation algorithm for a general class of multi-parametric optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the quality of discrete representations in multiple objective programming
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- New approaches to multi-objective optimization
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Deterministic algorithms for multi-criteria max-TSP
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- Approximately dominating representatives
- Hybrid metaheuristics. An emerging approach to optimization.
- Solving efficiently the 0-1 multi-objective knapsack problem
- Approximation algorithms for multi-criteria traveling salesman problems
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Exact arborescences, matchings and cycles
- Matching is as easy as matrix inversion
- On spanning tree problems with multiple objectives
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Analysis of FPTASes for the multi-objective shortest path problem
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- An improved FPTAS for Restricted Shortest Path.
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Almost optimal set covers in finite VC-dimension
- Single approximation for the biobjective Max TSP
- A general approximation method for bicriteria minimization problems
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Efficiently computing succinct trade-off curves
- Approximation methods in multiobjective programming
- How Good is the Chord Algorithm?
- Applications of Discrepancy Theory in Multiobjective Approximation
- Deterministic Algorithms for Multi-criteria TSP
- The Design of Approximation Algorithms
- Approximating Multiobjective Knapsack Problems
- On approximating multicriteria TSP
- Approximating Multi-criteria Max-TSP
- Multi-Criteria TSP: Min and Max Combined
- Approximability and Hardness in Multi-objective Optimization
- Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
- Iterative Rounding for Multi-Objective Optimization Problems
- Complexity of some parametric integer and network programming problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- The complexity of restricted spanning tree problems
- On cardinality of the set of alternatives in discrete many-criterion problems
- Approximation Schemes for the Restricted Shortest Path Problem
- An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
- The constrained minimum spanning tree problem
- Approximating Multiobjective Shortest Path in Practice
- Multicriteria Optimization
- Fundamentals of Computation Theory
- A simple efficient approximation scheme for the restricted shortest path problem
This page was built for publication: Approximation Methods for Multiobjective Optimization Problems: A Survey
