Advertisement

Integer Programming and Combinatorial Optimization

7th International IPCO Conference Graz, Austria, June 9–11, 1999 Proceedings

  • Gérard Cornuéjols
  • Rainer E. Burkard
  • Gerhard J. Woeginger
Conference proceedings IPCO 1999

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

Table of contents

  1. Front Matter
    Pages I-IX
    PDF
  2. Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
    Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
    Pages 1-16
  3. Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
    Alexander A. Ageev, Maxim I. Sviridenko
    Pages 17-30
  4. Solving the Convex Cost Integer Dual Network Flow Problem
    Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
    Pages 31-44
  5. Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem
    Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
    Pages 45-59
  6. Valid Inequalities for Problems with Additive Variable Upper Bounds
    Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
    Pages 60-72
  7. A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version)
    Mao-cheng Cai, Xiaotie Deng, Wenan Zang
    Pages 73-86
  8. On the Separation of Maximally Violated mod-k Cuts
    Alberto Caprara, Matteo Fischetti, Adam N. Letchford
    Pages 87-98
  9. Improved Approximation Algorithms for Capacitated Facility Location Problems
    Fabián A. Chudak, David P. Williamson
    Pages 99-113
  10. Optimal 3-Terminal Cuts and Linear Programming
    William H. Cunningham, Lawrence Tang
    Pages 114-125
  11. Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
    Dragoš Cvetković, Mirjana Čangalović, Vera Kovačević-Vujčić
    Pages 126-136
  12. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
    Friedrich Eisenbrand, Andreas S. Schulz
    Pages 137-150
  13. Universally Maximum Flow with Piecewise-Constant Capacities
    Lisa Fleischer
    Pages 151-165
  14. Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope
    Jean Fonlupt, Ali Ridha Mahjoub
    Pages 166-182
  15. An Orientation Theorem with Parity Conditions
    András Frank, Tibor Jordán, Zoltán Szigeti
    Pages 183-190
  16. Parity Constrained k-Edge-Connected Orientations
    András Frank, Zoltán Király
    Pages 191-201
  17. Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
    Eran Halperin, Uri Zwick
    Pages 202-217
  18. On the Chvátal Rank of Certain Inequalities
    Mark Hartmann, Maurice Queyranne, Yaoguang Wang
    Pages 218-233
  19. The Square-Free 2-Factor Problem in Bipartite Graphs
    David Hartvigsen
    Pages 234-241
  20. The m-Cost ATSP
    Christoph Helmberg
    Pages 242-258
  21. A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
    Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
    Pages 259-272
  22. Edge-Splitting Problems with Demands
    Tibor Jordán
    Pages 273-288
  23. Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors
    Kenji Kashiwabara, Masataka Nakamura, Takashi Takabatake
    Pages 289-303
  24. Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract)
    Gunnar W. Klau, Petra Mutzel
    Pages 304-319
  25. On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms
    Philip Klein, Neal Young
    Pages 320-327
  26. Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
    Stavros G. Kolliopoulos, Clifford Stein
    Pages 328-344
  27. Approximation Algorithms for a Directed Network Design Problem
    Vardges Melkonian, Éva Tardos
    Pages 345-360
  28. Optimizing over All Combinatorial Embeddings of a Planar Graph (Extended Abstract)
    Petra Mutzel, René Weiskircher
    Pages 361-376
  29. A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts
    Hiroshi Nagamochi, Toshihide Ibaraki
    Pages 377-390
  30. Scheduling Two Machines with Release Times
    John Noga, Steve Seiden
    Pages 391-399
  31. An Introduction to Empty Lattice Simplices
    András Sebő
    Pages 400-414
  32. On Optimal Ear-Decompositions of Graphs
    Zoltán Szigeti
    Pages 415-428
  33. Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract)
    Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan
    Pages 429-438
  34. Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut
    Eduardo Uchoa, Marcus Poggi de Aragão
    Pages 439-452
  35. Back Matter
    Pages 453-453
    PDF

About these proceedings

Keywords

Graph algorithms combinatorial optimization combinatorics complexity computational geometry optimization programming scheduling

Editors and affiliations

  • Gérard Cornuéjols
    • 1
  • Rainer E. Burkard
    • 2
  • Gerhard J. Woeginger
    • 2
  1. 1.GSIACarnegie Mellon UniversityPittsburghUSA
  2. 2.Institut für MathematikTechnische Universität GrazGrazAustria

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-48777-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66019-4
  • Online ISBN 978-3-540-48777-7
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site
Industry Sectors
Pharma
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment