A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One

DOI10.1007/978-3-540-85363-3_15zbMath1159.68673OpenAlexW1803589708MaRDI QIDQ3541795

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_15

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (6)

Analysis of FPTASes for the multi-objective shortest path problem ⋮ An FPTAS for optimizing a class of low-rank functions over a polytope ⋮ Using the WOWA operator in robust discrete optimization problems ⋮ Combinatorial optimization problems with uncertain costs and the OWA criterion ⋮ Simultaneous approximation of multi-criteria submodular function maximization ⋮ Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems

This page was built for publication: A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One