Polyhedral Combinatorics

The initial volume (beautifully produced on acid-free paper) in a new series on the state-of-the-art in various subjects related to the broad fields of discrete mathematics and theoretical computer science. Volume one presents 21 papers from the June 1989 workshop held in Morristown, New Jersey, on topics including cutting planes and matrices, existentially polytime theorems, Lehman's width-length characterization, spanning trees of different weights, the paths-selection problem, the cographic multiflow problem, and solvable classes of generalized traveling salesman problems. No index. Annotation copyright Book News, Inc. Portland, Or.