Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

DPD courier 4.99 € GLS courier 11.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Integer Programming and Combinatorial Optimization

Name: Integer Programming and Combinatorial Optimization
Brand: Springer, Berlin
SKU: 01564315
Price: 51.62 EUR
Availability: InStock
Author: William J. Cook
ISBN: 9783540436768

9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings

William J. Cook

Andreas S. Schulz

Language

English

Book Paperback

Libristo code: 01564315

Publishers Springer, Berlin, November 2001

This book constitutes the refereed proceedings of the 9th International Conference on Integer Progra... Full description

Libristo code: 01564315

125 b

51.62 €

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Estudios biográficos : hijos ilustres de la provincia de Córdoba Gabriel Delgado y Gallego

Paperback

25.15 €

Bedienungsanleitung fur Manner Denise Schenk

Paperback

8.98 €

Chronologie einer Obsession - Teil 2 Lisa Lassou

Hardback

30.20 €

La Criminalité en France. Rapport de l'observatoire national de la délinquance, 2011 Alain Bauer

Paperback

58.69 €

Le syndrome de Tarzan - Libérez-vous des lianes... Piquet

Paperback

27.57 €

Disney - Lilo et Stitch CP, niveau 2 Isabelle Albertin

Paperback

5.04 €

Самоучитель английского языка для детей и родителей Татьяна Морозова

Hardback

23.43 €

Přehled matematiky pro 2. stupeň ZŠ Alena Řepíková

Paperback

7.87 €

This book constitutes the refereed proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002, held in Cambridge, MA, USA, in May 2002.The 33 revised full papers presented were carefully reviewed and selected from a total of 110 submissions. Among the topics covered are scaling algorithms, flow algorithms, combinatorial optimization algorithms, approximate TSP solutions, graph computations, algorithmic geometry, mixed integer programming, network design, logistic scheduling, constraint solving, resource allocation, matching algorithms, and matroid intersection algorithms.