A decade of combinatorial optimization

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

Research output: Book/ReportReportAcademic

91 Downloads (Pure)

Abstract

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 polynomial-time approximability and summarize the advances in local search.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages10
Publication statusPublished - 1997

Publication series

NameMemorandum COSOR
Volume9709
ISSN (Print)0926-4493

Fingerprint

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

Cite this