Lecture Notes in Computer Science

Integer Programming and Combinatorial Optimization

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

Editors: Cook, William J., Schulz, Andreas S. (Eds.)

Buy this book

eBook 74,96 €
price for Spain (gross)
  • ISBN 978-3-540-47867-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 93,59 €
price for Spain (gross)
  • ISBN 978-3-540-43676-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
About this book

This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research.

Table of contents (33 chapters)

  • A Faster Scaling Algorithm for Minimizing Submodular Functions

    Iwata, Satoru

    Pages 1-8

    Preview Buy Chapter 30,19 €
  • A Generalization of Edmonds’ Matching and Matroid Intersection Algorithms

    Spille, Bianca (et al.)

    Pages 9-20

    Preview Buy Chapter 30,19 €
  • A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization

    Tamura, Akihisa

    Pages 21-35

    Preview Buy Chapter 30,19 €
  • The Quickest Multicommodity Flow Problem

    Fleischer, Lisa (et al.)

    Pages 36-53

    Preview Buy Chapter 30,19 €
  • A New Min-Cut Max-Flow Ratio for Multicommodity Flows

    Günlük, Oktay

    Pages 54-66

    Preview Buy Chapter 30,19 €

Buy this book

eBook 74,96 €
price for Spain (gross)
  • ISBN 978-3-540-47867-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 93,59 €
price for Spain (gross)
  • ISBN 978-3-540-43676-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Integer Programming and Combinatorial Optimization
Book Subtitle
9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings
Editors
  • William J. Cook
  • Andreas S. Schulz
Series Title
Lecture Notes in Computer Science
Series Volume
2337
Copyright
2002
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-47867-6
DOI
10.1007/3-540-47867-1
Softcover ISBN
978-3-540-43676-8
Series ISSN
0302-9743
Edition Number
1
Number of Pages
XI, 487
Topics