Fundamentals of Computation Theory
From MaRDI portal
Publication:5492939
DOI10.1007/11537311zbMath1122.90083OpenAlexW2491671784MaRDI QIDQ5492939
Laurent Gourvès, Jérôme Monnot, Evripidis Bampis, Eric Angel
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11537311
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (6)
Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Approximation with a fixed number of solutions of some multiobjective maximization problems ⋮ New Approximation Algorithms for (1,2)-TSP ⋮ Deterministic Algorithms for Multi-criteria TSP ⋮ Approximation algorithms for multi-criteria traveling salesman problems
This page was built for publication: Fundamentals of Computation Theory
