Polyhedral combinatorics : proceedings of a DIMACS workshop : June 12-16, 1989
著者
書誌事項
Polyhedral combinatorics : proceedings of a DIMACS workshop : June 12-16, 1989
（DIMACS series in discrete mathematics and theoretical computer science, v. 1）
American Mathematical Society , Association for Computing Machinery, c1990
大学図書館所蔵 件 / 全26件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT&T Bell labs, Bellcore" -- T.p
"The DIMACS Workshop on Polyhedral Combinatorics was held at the Center for Discrete Mathematics and Theoretical Computer Science on June 12-16, 1989" -- T.p. verso
Includes bibliographical references
内容説明・目次
内容説明
This book, the first volume in the ""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.
目次
Matrix cones, projection representations, and stable set polyhedra by L. Lovasz and A. Schrijver A generalization of Lovasz's $\theta$ function by G. Narasimhan and R. Manber On cutting planes and matrices by A. M. H. Gerards Random volumes in the $n$-cube by M. E. Dyer, A. Furedi, and C. McDiarmid Test sets for integer programs, $\forall \exists$ sentences by R. Kannan Solvable classes of generalized traveling salesman problems by S. N. Kabadi and R. Chandrasekaran Handles and teeth in the symmetric traveling salesman polytope by D. Naddef On the complexity of branch and cut methods for the traveling salesman problem by W. Cook and M. Hartmann Existentially polytime theorems by K. Cameron and J. Edmonds The width-length inequality and degenerate projective planes by A. Lehman On Lehman's width-length characterization by P. D. Seymour Applications of polyhedral combinatorics to multicommodity flows and compact surfaces by A. Schrijver Vertex-disjoint simple paths of given homotopy in a planar graph by A. Frank and A. Schrijver On disjoint homotopic paths in the plane by A. Frank On the complexity of the disjoint paths problem (extended abstract) by M. Middendorf and F. Pfeiffer The paths-selection problem by M. Middendorf and F. Pfeiffer Planar multicommodity flows, max cut, and the Chinese postman problem by F. Barahona The cographic multiflow problem: An epilogue by A. Sebo Exact edge-colorings of graphs without prescribed minors by O. Marcotte On the chromatic index of multigraphs and a conjecture of Seymour, (II) by O. Marcotte Spanning trees of different weights by A. Schrijver and P. D. Seymour.
「Nielsen BookData」 より