Polyhedral Combinatorics: Proceedings of a Dimacs Workshop, June 12-16, 1989 - Rilegato

Cook, William

 
9780821865910: Polyhedral Combinatorics: Proceedings of a Dimacs Workshop, June 12-16, 1989

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

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.

Product Description

Book by Cook William

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.