Skip to main content
SpringerLink
Log in

Integer Programming and Combinatorial Optimization

6th International IPCO Conference Houston, Texas, June 22–24, 1998 Proceedings

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Robert E. Bixby

    1. Department of Computational and Applied Mathematics, Rice University, Houston, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. E. Andrew Boyd

    1. PROS Strategic Solutions, Houston, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Roger Z. Ríos-Mercado

    1. Department of Industrial, Engineering, Texas A&M University, Houston, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: IPCO 1998.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (32 papers)

  1. Front Matter

    Pages I-IX
    Download chapter PDF

  2. 0,1 Matrices, Matroids

    1. The Packing Property

      • Gérard Cornuéjols, Bertrand Guenin, François Margot
      Pages 1-8

    2. A Characterization of Weakly Bipartite Graphs

      • Bertrand Guenin
      Pages 9-22

    3. Bipartite Designs

      • Grigor Gasparyan
      Pages 23-36

    4. Characterizing Noninteger Polyhedra with 0–1 Constraints

      • András Sebő
      Pages 37-52

    5. A Theorem of Truemper

      • Michele Conforti, Ajai Kapoor
      Pages 53-68

    6. The Generalized Stable Set Problem for Claw-Free Bidirected Graphs

      • Daishin Nakamura, Akihisa Tamura
      Pages 69-83

    7. On a Min-max Theorem of Cacti

      • Zoltán Szigeti
      Pages 84-95

  3. Edge Connectivity

    1. Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs

      • Hiroshi Nagamochi, Peter Eades
      Pages 96-111

    2. A New Bound for the 2-Edge Connected Subgraph Problem

      • Robert Carr, R. Ravi
      Pages 112-125

    3. An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs

      • Joseph Cheriyan, András Sebő, Zoltán Szigeti
      Pages 126-136

  4. Algorithms

    1. Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width

      • Gruia Călinescu, Cristina G. Fernandes, Bruce Reed
      Pages 137-152

    2. Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs

      • Stavros G. Kolliopoulos, Clifford Stein
      Pages 153-168

    3. Approximation Algorithms for the Mixed Postman Problem

      • Balaji Raghavachari, Jeyakesavan Veerasamy
      Pages 169-179

    4. Improved Approximation Algorithms for Uncapacitated Facility Location

      • Fabián A. Chudak
      Pages 180-194

    5. The Maximum Traveling Salesman Problem Under Polyhedral Norms

      • Alexander Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe
      Pages 195-201

  5. Integer Programming Applications

    1. Polyhedral Combinatorics of Benzenoid Problems

      • Hernán Abeledo, Gary Atkinson
      Pages 202-212

    2. Consecutive Ones and a Betweenness Problem in Computational Biology

      • Thomas Christof, Marcus Oswald, Gerhard Reinelt
      Pages 213-228

    3. Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables

      • Karen Aardal, Cor Hurkens, Arjen K. Lenstra
      Pages 229-242

  6. Integer Programming Computation

    1. The Intersection of Knapsack Polyhedra and Extensions

      • Alexander Martin, Robert Weismantel
      Pages 243-256
Back to top

Other volumes

  1. Integer Programming and Combinatorial Optimization

Keywords

Editors and Affiliations

  • Department of Computational and Applied Mathematics, Rice University, Houston, USA

    Robert E. Bixby

  • PROS Strategic Solutions, Houston, USA

    E. Andrew Boyd

  • Department of Industrial, Engineering, Texas A&M University, Houston, USA

    Roger Z. Ríos-Mercado

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation