Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Approximation Methods for Multiobjective Optimization Problems: A Survey

scientific article; zbMATH DE number 7549334

Language	Label	Description	Also known as
default for all languages	No label defined
English	Approximation Methods for Multiobjective Optimization Problems: A Survey	scientific article; zbMATH DE number 7549334

Statements

instance of

scholarly article

0 references

title

Approximation Methods for Multiobjective Optimization Problems: A Survey (English)

0 references

0 references

0 references

0 references

INFORMS Journal on Computing

0 references

publication date

28 June 2022

0 references

zbMATH Keywords

multiobjective optimization

0 references

approximation algorithm

0 references

approximate Pareto set

0 references

survey

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1287/ijoc.2020.1028

0 references

cites work

Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem

0 references

Approximation algorithms for the bi-criteria weighted MAX-CUT problem

0 references

Q4796176

0 references

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.

0 references

Fundamentals of Computation Theory

0 references

Exact arborescences, matchings and cycles

0 references

Approximation with a fixed number of solutions of some multiobjective maximization problems

0 references

Implementing an efficient fptas for the 0-1 multi-objective knapsack problem

0 references

Solving efficiently the 0-1 multi-objective knapsack problem

0 references

Approximate Pareto sets of minimal size for multi-objective optimization problems

0 references

Discrete representation of the non-dominated set for multi-objective optimization problems using kernels

0 references

Single approximation for the biobjective Max TSP

0 references

Budgeted matching and budgeted matroid intersection via the gasoline puzzle

0 references

Approximating Multi-criteria Max-TSP

0 references

Approximating Multiobjective Shortest Path in Practice

0 references

Analysis of FPTASes for the multi-objective shortest path problem

0 references

Almost optimal set covers in finite VC-dimension

0 references

Q3745296

0 references

Complexity of some parametric integer and network programming problems

0 references

Multi-budgeted matchings and matroid intersection via dependent rounding

0 references

How good is the Chord algorithm?

0 references

Q3579439

0 references

Small approximate Pareto sets for biobjective shortest paths and other problems

0 references

Multicriteria Optimization

0 references

Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.

0 references

Hybrid metaheuristics. An emerging approach to optimization.

0 references

On cardinality of the set of alternatives in discrete many-criterion problems

0 references

An improved FPTAS for Restricted Shortest Path.

0 references

Approximating multiobjective knapsack problems

0 references

On the quality of discrete representations in multiple objective programming

0 references

Q4198056

0 references

A survey on multi-constrained optimal path computation: exact and approximate algorithms

0 references

Applications of discrepancy theory in multiobjective approximation

0 references

Approximability and Hardness in Multi-objective Optimization

0 references

Iterative Rounding for Multi-Objective Optimization Problems

0 references

New approaches to multi-objective optimization

0 references

A general approximation method for bicriteria minimization problems

0 references

On spanning tree problems with multiple objectives

0 references

Q3888874

0 references

Approximation Schemes for the Restricted Shortest Path Problem

0 references

An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection

0 references

A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.

0 references

Multi-criteria approximation schemes for the resource constrained shortest path problem

0 references

Approximately dominating representatives

0 references

Q3320130

0 references

A simple efficient approximation scheme for the restricted shortest path problem

0 references

Multi-criteria TSP: Min and Max combined

0 references

Deterministic algorithms for multi-criteria TSP

0 references

Deterministic algorithms for multi-criteria max-TSP

0 references

On approximating multicriteria \textsc{TSP}

0 references

Matching is as easy as matrix inversion

0 references

The complexity of restricted spanning tree problems

0 references

The constrained minimum spanning tree problem

0 references

Approximation methods in multiobjective programming

0 references

Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming

0 references

Q3802899

0 references

Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications

0 references

Efficiently computing succinct trade-off curves

0 references

Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems

0 references

The design of approximation algorithms

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1287/IJOC.2020.1028

0 references

Sitelinks

Mathematics(1 entry)

mardi Approximation Methods for Multiobjective Optimization Problems: A Survey