Progress in Combinatorial Optimization provides information pertinent to the fundamental aspects of combinatorial optimization. This book discusses how to determine whether or not a particular structure exists. Organized into 21 chapters, this book begins with an overview of a polar characterization of facets of polyhedra obtained by lifting facets of lower dimensional polyhedra. This text then discusses how to obtain bounds on the value of the objective in a graph partitioning problem in terms of spectral information about the graph. Other chapters consider the notion of a triangulation of an oriented matroid and show that oriented matroid triangulation yield triangulations of the underlying polytopes. This book discusses as well the selected results and problems on perfect ad imperfect graphs. The final chapter deals with the weighted parity problem for gammoids, which can be reduced to the weighted graphic matching problem. This book is a valuable resource for mathematicians and research workers.
"synopsis" may belong to another edition of this title.
Book Description Academic Press Canada, Toronto, Canada, 1984. Hard Cover. Book Condition: Very Good +. No Jacket. 1st. 374pp.; HB gray w/orange; slight rub; PONstamps,endpaper&pub.pg.; clean,tight pgs. "Combinatorial optimization and, more generally, the study of algorithmic problems is one of the newest and fastest growing areas in the field of combinatorial mathematics. The papers contained in this volume provide an excellent cross section of the field up to the summer of 1982" Size: 8vo - over 7¾" - 9¾" tall. Bookseller Inventory # 029303