Skip to main content
SpringerLink
Log in

Integer Programming and Combinatorial Optimization

12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Matteo Fischetti
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. David P. Williamson
    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 4513)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: IPCO 2007.

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 (36 papers)

  1. Front Matter

    Download chapter PDF

  2. Session 1

    1. Inequalities from Two Rows of a Simplex Tableau

      • Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey
      Pages 1-15

    2. Cuts for Conic Mixed-Integer Programming

      • Alper Atamtürk, Vishnu Narayanan
      Pages 16-29

    3. Sequential-Merge Facets for Two-Dimensional Group Problems

      • Santanu S. Dey, Jean-Philippe P. Richard
      Pages 30-42

  3. Session 2

    1. Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)

      • David Hartvigsen, Yanjun Li
      Pages 43-52

    2. The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization

      • Rene Beier, Heiko Röglin, Berthold Vöcking
      Pages 53-67

    3. Finding a Polytope from Its Graph in Polynomial Time

      • Eric J. Friedman
      Pages 68-73

  4. Session 3

    1. Orbitopal Fixing

      • Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch
      Pages 74-88

    2. New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing

      • Egon Balas, Pierre Bonami
      Pages 89-103

    3. Orbital Branching

      • James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio
      Pages 104-118

  5. Session 4

    1. Distinct Triangle Areas in a Planar Point Set

      • Adrian Dumitrescu, Csaba D. Tóth
      Pages 119-129

    2. Scheduling with Precedence Constraints of Low Fractional Dimension

      • Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
      Pages 130-144

    3. Approximation Algorithms for 2-Stage Stochastic Scheduling Problems

      • David B. Shmoys, Mauro Sozio
      Pages 145-157

  6. Session 5

    1. On Integer Programming and the Branch-Width of the Constraint Matrix

      • William H. Cunningham, Jim Geelen
      Pages 158-166

    2. Matching Problems in Polymatroids Without Double Circuits

      • Márton Makai, Gyula Pap, Jácint Szabó
      Pages 167-181

    3. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)

      • Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
      Pages 182-196

  7. Session 6

    1. On a Generalization of the Master Cyclic Group Polyhedron

      • Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
      Pages 197-209

    2. A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications

      • Bo Zeng, Jean-Philippe P. Richard
      Pages 210-224

    3. On the Exact Separation of Mixed Integer Knapsack Cuts

      • Ricardo Fukasawa, Marcos Goycoolea
      Pages 225-239
Back to top

Other volumes

  1. Integer Programming and Combinatorial Optimization

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation