Advertisement

Integer Programming and Combinatorial Optimization

10th International IPCO Conference, New York, NY, USA, June 7-11, 2004. Proceedings

  • Daniel Bienstock
  • George Nemhauser
Conference proceedings IPCO 2004

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3064)

Table of contents

  1. Front Matter
  2. Session 1

    1. Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo Reis, Eduardo Uchoa, Renato F. Werneck
      Pages 1-15
    2. Pasquale Avella, Sara Mattia, Antonio Sassano
      Pages 16-32
    3. Sanjeeb Dash, Oktay Günlük
      Pages 33-45
  3. Session 2

  4. Session 3

    1. Dimitris Bertsimas, Aurélie Thiele
      Pages 86-100
    2. Eyjolfur Asgeirsson, Jonathan Berry, Cynthia A. Phillips, David J. Phillips, Cliff Stein, Joel Wein
      Pages 116-131
  5. Session 4

    1. Stéphane Bessy, Stéphan Thomassé
      Pages 132-138
    2. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan
      Pages 152-162
  6. Session 5

    1. I. R. de Farias Jr.
      Pages 163-177
    2. Gianni Codato, Matteo Fischetti
      Pages 178-195
    3. Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
      Pages 196-205
  7. Session 6

    1. Retsef Levi, David B. Shmoys, Chaitanya Swamy
      Pages 206-218
  8. Session 7

    1. J. A. De Loera, D. Haws, R. Hemmecke, P. Huggins, R. Yoshida
      Pages 244-255
    2. András Sebő, László Szegő
      Pages 256-270
    3. Jon Lee, François Margot
      Pages 271-282
  9. Session 8

    1. José R. Correa, Andreas S. Schulz
      Pages 283-297
    2. Asaf Levin, Gerhard J. Woeginger
      Pages 298-307
  10. Session 9

  11. Session 10

    1. Satoru Iwata, Satoko Moriguchi, Kazuo Murota
      Pages 352-367
    2. Alexander V. Karzanov
      Pages 368-387
    3. Nicola Apollonio, András Sebő
      Pages 388-400
  12. Session 11

    1. Tamás Király, Márton Makai
      Pages 416-430
    2. Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi
      Pages 431-443
  13. Back Matter

About these proceedings

Keywords

algorithms approximation combinatorial optimization combinatorics complexity computational complexity computational geometry game theory graph algorithms integer programming mathematical programming network algorithms optimization programming scheduling

Editors and affiliations

  • Daniel Bienstock
    • 1
  • George Nemhauser
    • 2
  1. 1.Department of IEORColumbia UniversityNew York, NYUSA
  2. 2.H. Milton Stewart School of Industrial and Systems EngineeringGeorgia Institute of TechnologyAtlantaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/b97946
  • Copyright Information Springer-Verlag Berlin Heidelberg 2004
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-22113-5
  • Online ISBN 978-3-540-25960-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Pharma
Biotechnology
Finance, Business & Banking
IT & Software
Telecommunications
Consumer Packaged Goods
Aerospace
Oil, Gas & Geosciences
Engineering