Approximation Methods for Multiobjective Optimization Problems: A Survey
From MaRDI portal
Publication:5084597
Recommendations
- Approximation methods in multiobjective programming
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An approximation algorithm for convex multi-objective programming problems
- A survey of recent developments in multiobjective optimization
Cites work
- scientific article; zbMATH DE number 3850828 (Why is no real title available?)
- scientific article; zbMATH DE number 5764846 (Why is no real title available?)
- scientific article; zbMATH DE number 3980505 (Why is no real title available?)
- scientific article; zbMATH DE number 4070651 (Why is no real title available?)
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1875417 (Why is no real title available?)
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- A general approximation method for bicriteria minimization problems
- A simple efficient approximation scheme for the restricted shortest path problem
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- Almost optimal set covers in finite VC-dimension
- An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
- An improved FPTAS for Restricted Shortest Path.
- Analysis of FPTASes for the multi-objective shortest path problem
- Applications of discrepancy theory in multiobjective approximation
- Approximability and Hardness in Multi-objective Optimization
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Approximately dominating representatives
- Approximating Multi-criteria Max-TSP
- Approximating Multiobjective Shortest Path in Practice
- Approximating multiobjective knapsack problems
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Approximation Schemes for the Restricted Shortest Path Problem
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Approximation methods in multiobjective programming
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Complexity of some parametric integer and network programming problems
- Deterministic algorithms for multi-criteria TSP
- Deterministic algorithms for multi-criteria max-TSP
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Efficiently computing succinct trade-off curves
- Exact arborescences, matchings and cycles
- Fundamentals of Computation Theory
- How good is the Chord algorithm?
- Hybrid metaheuristics. An emerging approach to optimization.
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Iterative Rounding for Multi-Objective Optimization Problems
- Matching is as easy as matrix inversion
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Multi-criteria TSP: Min and Max combined
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Multicriteria Optimization
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- New approaches to multi-objective optimization
- On approximating multicriteria \textsc{TSP}
- On cardinality of the set of alternatives in discrete many-criterion problems
- On spanning tree problems with multiple objectives
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- On the quality of discrete representations in multiple objective programming
- Single approximation for the biobjective Max TSP
- Small approximate Pareto sets for biobjective shortest paths and other problems
- Solving efficiently the 0-1 multi-objective knapsack problem
- The complexity of restricted spanning tree problems
- The constrained minimum spanning tree problem
- The design of approximation algorithms
Cited in
(22)- Approximability and Hardness in Multi-objective Optimization
- Exact and approximate determination of the Pareto front using minimal correction subsets
- scientific article; zbMATH DE number 1160625 (Why is no real title available?)
- Approximating multiobjective optimization problems: how exact can you be?
- Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
- An Extension of the MOON2/MOON2R Approach to Many-Objective Optimization Problems
- An approximation algorithm for a general class of multi-parametric optimization problems
- The power of the weighted sum scalarization for approximating multiobjective optimization problems
- Applications of discrepancy theory in multiobjective approximation
- An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints
- Approximating biobjective minimization problems using general ordering cones
- An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
- Obtaining approximately optimal and diverse solutions via dispersion
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
- A survey of recent developments in multiobjective optimization
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Approximation of convex bodies by multiple objective optimization and an application in reachable sets
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
- Approximating single- and multi-objective nonlinear sum and product knapsack problems
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
This page was built for publication: Approximation Methods for Multiobjective Optimization Problems: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084597)
