R&E 7

Catalogue of all
Book Series

List of Books
in this Series

Previous Book

Next Book

Research and Exposition in Mathematics -- Volume 7

   Enlarged Picture

M. Jünger

Polyhedral Combinatorics and the
Acyclic Subdigraph Problem

138 p., soft cover, ISBN 3-88538-207-5, EUR 20.00, 1985

Concise introduction to polyhedral combinatorics. The concept is then applied to the acyclic subdigraph problem, a prominent member of the class of NP-hard optimization problems with many practical applications. Solution algorithms are developed within a linear programming framework.

"... excellent study in combinatorial optimization".
(Syst. Anal. Model. Simulation)