## Combinatorial Optimization: A Survey

### Authors: Martin Grotschel and Laszlo Lovasz

ABSTRACT

This paper is a chapter of the forthcoming {\it Handbook of Combinatorics}, to be published by North-Holland. It surveys the basic techniques and methods in combinatorial optimization. We organize our material according to the fundamental algorithmic techniques and illustrate them on problems to which these methods have been applied successfully. Special attention is given to approximation algorithms and fast (primal and dual) heuristics.

Paper available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1993/93-29.ps