Skip to main content
  • Conference proceedings
  • © 1999

Integer Programming and Combinatorial Optimization

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

Conference proceedings info: IPCO 1999.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (33 papers)

  1. Front Matter

    Pages I-IX
  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. Solving the Convex Cost Integer Dual Network Flow Problem

    • Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
    Pages 31-44
  4. Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem

    • Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
    Pages 45-59
  5. Valid Inequalities for Problems with Additive Variable Upper Bounds

    • Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
    Pages 60-72
  6. A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version)

    • Mao-cheng Cai, Xiaotie Deng, Wenan Zang
    Pages 73-86
  7. On the Separation of Maximally Violated mod-k Cuts

    • Alberto Caprara, Matteo Fischetti, Adam N. Letchford
    Pages 87-98
  8. Improved Approximation Algorithms for Capacitated Facility Location Problems

    • Fabián A. Chudak, David P. Williamson
    Pages 99-113
  9. Optimal 3-Terminal Cuts and Linear Programming

    • William H. Cunningham, Lawrence Tang
    Pages 114-125
  10. Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem

    • Dragoš Cvetković, Mirjana Čangalović, Vera Kovačević-Vujčić
    Pages 126-136
  11. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube

    • Friedrich Eisenbrand, Andreas S. Schulz
    Pages 137-150
  12. An Orientation Theorem with Parity Conditions

    • András Frank, Tibor Jordán, Zoltán Szigeti
    Pages 183-190
  13. Parity Constrained k-Edge-Connected Orientations

    • András Frank, Zoltán Király
    Pages 191-201
  14. On the Chvátal Rank of Certain Inequalities

    • Mark Hartmann, Maurice Queyranne, Yaoguang Wang
    Pages 218-233
  15. The m-Cost ATSP

    • Christoph Helmberg
    Pages 242-258

Other Volumes

  1. Integer Programming and Combinatorial Optimization

Editors and Affiliations

  • GSIA, Carnegie Mellon University, Pittsburgh, USA

    Gérard Cornuéjols

  • Institut für Mathematik, Technische Universität Graz, Graz, Austria

    Rainer E. Burkard, Gerhard J. Woeginger

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access