Nicht lieferbar
Polyhedral Combinatorics
Versandkostenfrei!
Nicht lieferbar
This book, the first volume in the new DIMACS book series, contains the proceedings of the first DIMACS workshop. The workshop, which was held in June 1989 in Morristown, New Jersey, focused on polyhedral combinatorics. Two series of lectures were presented by L Lovasz and A Schrijver and there were a number of shorter lectures. The topics covered include multicommodity flows, graph matchings and colorings, the traveling salesman problem, integer programming, and complexity theory. Aimed at researchers in combinatorics and combinatorial optimization, this book will provide readers with an over...
This book, the first volume in the new DIMACS book series, contains the proceedings of the first DIMACS workshop. The workshop, which was held in June 1989 in Morristown, New Jersey, focused on polyhedral combinatorics. Two series of lectures were presented by L Lovasz and A Schrijver and there were a number of shorter lectures. The topics covered include multicommodity flows, graph matchings and colorings, the traveling salesman problem, integer programming, and complexity theory. Aimed at researchers in combinatorics and combinatorial optimization, this book will provide readers with an overview of recent advances in combinatorial optimization.
Table of contents:
L Lovasz and A Schrijver, Matrix cones, projection representations and stable set polyhedra; Giri Narasimhan and Rachel Manber, A generalization of Lovasz *c function; A M H Gererds, On cutting planes and matrices; M E Dyer, Z Furedi, and C McDiarmid, Random volumes in the n-cube; Ravl Kannan, Tests sets for integer programs,VA sentences; S N Kabadi and R Chandresekaran, Solvable classes of generalized traveling salesman problems; Denis Naddef, Handles and teeth in the symmetric traveling salesman polytope; V Chvatal, W Cook and M Hartmann, On the complexity of branch and cut methods for the traveling salesman problem; Kathie Cameron and Jack Edmonds, Existentially polytime theorems; Alfred Lehman, The width-length inequality and degenerate projective planes; P D Seymour, On Lehman's width-length characterization; A Schrijver, Applications of polyhedral combinatorics to multicommodity flows and compact surfaces; A Frank and A Schrijver, Vertex-disjoint simple paths of given homotopy in a planar graph; Andras Frank, On disjoint homotopic paths in the plane; Matthias Middendorf and Frank Pfeiffer, On the complexity of the disjoint paths problem (extended abstract); Matthias Middendorf and Frank Pfeiffer, The paths-selection problem; Francisco Barahona, Planar multicommodity flows, max cut, and the Chinese Postman problem; Andras Sebo, The cographic multiflow problem; an epilogue; Odile Marcotte, Exact edge-colorings of graphs without prescribed minors; Odile Marcotte, On the chromatic index of multigraphs and a conjecture of Seymour (II); A Schrijver and P D Seymour, Spanning trees of different weights.
Table of contents:
L Lovasz and A Schrijver, Matrix cones, projection representations and stable set polyhedra; Giri Narasimhan and Rachel Manber, A generalization of Lovasz *c function; A M H Gererds, On cutting planes and matrices; M E Dyer, Z Furedi, and C McDiarmid, Random volumes in the n-cube; Ravl Kannan, Tests sets for integer programs,