Advertisement

Table of contents

  1. Front Matter
  2. Imre Bárány, Shmuel Onn
    Pages 1-15
  3. Rekha R. Thomas, Robert Weismantel
    Pages 16-30
  4. Carsten Rössner, Claus P. Schnorr
    Pages 31-43
  5. Sunil Chopra, Itzhak Gilboa, S. Trilochan Sastry
    Pages 44-57
  6. Cynthia Barnhart, Christopher A. Hane, Pamela H. Vance
    Pages 58-71
  7. Alberto Caprara, Matteo Fischetti, Paolo Toth
    Pages 72-84
  8. Stavros G. Kolliopoulos, Clifford Stein
    Pages 94-104
  9. Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal Young
    Pages 105-117
  10. Magnús M. Halldórsson
    Pages 118-131
  11. Michel X. Goemans, David P. Williamson
    Pages 147-161
  12. Rainer E. Burkard, Eranda Çela, Günther Rote, Gerhard J. Woeginger
    Pages 204-218
  13. Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
    Pages 234-248
  14. Kazuo Murota
    Pages 260-274
  15. Beth Novick, András Sebő
    Pages 275-287
  16. Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
    Pages 330-344
  17. Hui Chen, Alan Frieze
    Pages 345-358
  18. Chung-Piaw Teo, Dimitris Bertsimas
    Pages 359-373
  19. J. A. Hoogeveen, A. P. A. Vestjens
    Pages 404-414
  20. Michel X. Goemans, Leslie A. Hall
    Pages 415-429
  21. Rudolf Müller, Andreas S. Schulz
    Pages 430-444
  22. Meinrad Funke, Gerhard Reinelt
    Pages 445-459
  23. Lisa Fleischer, Éva Tardos
    Pages 475-489
  24. Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
    Pages 490-504
  25. Back Matter

About these proceedings

Introduction

This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996.
The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem.

Keywords

Ganzzahliges Programmieren Handlungsreisendenproblem (TSP) Kombiatorische Algorithmen Kombinatorische Optimierung algorithms combinatorial algorithms combinatorial optimization integer programming programming scheduling traveling salesman problem (TSP)

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-61310-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 1996
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-61310-7
  • Online ISBN 978-3-540-68453-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications