 |


|
 |
Item Details
Title:
|
POLYHEDRAL COMBINATORICS
|
By: |
William Cook, Paul D. Seymour |
Format: |
Hardback |

List price:
|
£72.00 |
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
ISBN 10: |
0821865919 |
ISBN 13: |
9780821865910 |
Publisher: |
AMERICAN MATHEMATICAL SOCIETY |
Pub. date: |
1 January, 1990 |
Series: |
Series in Discrete Mathematics & Theoretical Computer Science No. 1 |
Pages: |
288 |
Description: |
Contains the proceedings of the first DIMACS workshop. This work covers topics including multicommodity flows, graph matchings and colorings, the traveling salesman problem, integer programming and complexity theory. It is suitable for researchers in combinatorics and combinatorial optimization. |
Synopsis: |
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. |
Publication: |
US |
Imprint: |
American Mathematical Society |
Returns: |
Returnable |
|
|
|
 |


|

|

|

|

|
No Cheese, Please!
A fun picture book for children with food allergies - full of friendship and super-cute characters!Little Mo the mouse is having a birthday party.

|
My Brother Is a Superhero
Luke is massively annoyed about this, but when Zack is kidnapped by his arch-nemesis, Luke and his friends have only five days to find him and save the world...

|

|

|
|
 |