Approximability of hard combinatorial optimization problems: an introduction
From MaRDI portal
Publication:1593534
DOI10.1023/A:1018987015651zbMath0997.90069MaRDI QIDQ1593534
Francesco Maffioli, Giulia Galbiati
Publication date: 17 January 2001
Published in: Annals of Operations Research (Search for Journal in Brave)
NP-completenesscombinatorial optimization problemsintroductory surveycharacterization of approximation classes
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
This page was built for publication: Approximability of hard combinatorial optimization problems: an introduction