A decade of combinatorial optimization

K.I. Aardal, S. Hoesel, van, J.K. Lenstra, L. Stougie

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review


This paper offers a brief overview of the developments in combinatorial optimization during the past decade. We discuss improvements in polynomial-time algorithms for problems on graphs and networks, and review the methodological and computational progress in linear and integer optimization. Some of the more prominent software packages in these areas are mentioned. With respect to obtaining approximate solutions to NP-hard problems, we survey recent positive and negative results on polynomialtime approximability and summarize the advances in local search.
Original languageEnglish
Title of host publicationTen years LNMB
EditorsW.K. Klein Haneveld, O.J. Vrieze, L.C.M. Kallenberg
Place of PublicationAmsterdam
PublisherCentrum voor Wiskunde en Informatica
ISBN (Print)90-6196-475-X
Publication statusPublished - 1997

Publication series

NameCWI Tract


Dive into the research topics of 'A decade of combinatorial optimization'. Together they form a unique fingerprint.

Cite this