Muutke küpsiste eelistusi

Integer Programming and Combinatorial Optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings 2007 ed. [Pehme köide]

  • Formaat: Paperback / softback, 502 pages, kõrgus x laius: 235x155 mm, kaal: 777 g, IX, 502 p., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 4513
  • Ilmumisaeg: 19-Jun-2007
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540727914
  • ISBN-13: 9783540727910
  • Formaat: Paperback / softback, 502 pages, kõrgus x laius: 235x155 mm, kaal: 777 g, IX, 502 p., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 4513
  • Ilmumisaeg: 19-Jun-2007
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540727914
  • ISBN-13: 9783540727910

This book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007.

Among the topics addressed in the 36 revised full papers are approximation algorithms, algorithmic game theory, computational biology, integer programming, polyhedral combinatorics, scheduling theory and scheduling algorithms, as well as semidefinite programs.



This book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007.Among the topics addressed in the 36 revised full papers are approximation algorithms, algorithmic game theory, computational biology, integer programming, polyhedral combinatorics, scheduling theory and scheduling algorithms, as well as semidefinite programs.
Session 1
Inequalities from Two Rows of a Simplex Tableau
1(15)
Kent Andersen
Quentin Louveaux
Robert Weismantel
Laurence A. Wolsey
Cuts for Conic Mixed-Integer Programming
16(14)
Alper Atamturk
Vishnu Narayanan
Sequential-Merge Facets for Two-Dimensional Group Problems
30(13)
Santanu S. Dey
Jean-Philippe P. Richard
Session 2
Triangle-Free Simple 2-Matchings in Subcubic Graphs
43(10)
David Hartvigsen
Yanjun Li
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
53(15)
Rene Beier
Heiko Roglin
Berthold Vocking
Finding a Polytope from Its Graph in Polynomial Time
68(6)
Eric J. Friedman
Session 3
Orbitopal Fixing
74(15)
Volker Kaibel
Matthias Peinhardt
Marc E. Pfetsch
New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
89(15)
Egon Balas
Pierre Bonami
Orbital Branching
104(15)
James Ostrowski
Jeff Linderoth
Fabrizio Rossi
Stefano Smriglio
Session 4
Distinct Triangle Areas in a Planar Point Set
119(11)
Adrian Dumitrescu
Csaba D. Toth
Scheduling with Precedence Constraints of Low Fractional Dimension
130(15)
Christoph Ambuhl
Monaldo Mastrolilli
Nikolaus Mutsanas
Ola Svensson
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
145(13)
David B. Shmoys
Mauro Sozio
Session 5
On Integer Programming and the Branch-Width of the Constraint Matrix
158(9)
William H. Cunningham
Jim Geelen
Matching Problems in Polymatroids Without Double Circuits
167(15)
Marton Makai
Gyula Pap
Jacint Szabo
Maximizing a Submodular Set Function Subject to a Matroid Constraint
182(15)
Gruia Calinescu
Chandra Chekuri
Martin Pal
Jan Vondrak
Session 6
On a Generalization of the Master Cyclic Group Polyhedron
197(13)
Sanjeeb Dash
Ricardo Fukasawa
Oktay Gunluk
A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
210(15)
Bo Zeng
Jean-Philippe P. Richard
On the Exact Separation of Mixed Integer Knapsack Cuts
225(15)
Ricardo Fukasawa
Marcos Goycoolec
Session 7
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
240(12)
James B. Orlin
On Convex Minimization over Base Polytopes
252(15)
Kiyohito Nagano
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
267(13)
Toshinari Itoko
Satoru Iwata
Session 8
Generating Multiple Solutions for Mixed Integer Programming Problems
280(15)
Emilie Danna
Mary Fenelon
Zonghao Gu
Roland Wunderling
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
295(15)
Franz Rendl
Giovanni Rinaldi
Angelika Wiegele
DINS, a MIP Improvement Heuristic
310(14)
Shubhashis Ghosh
Session 9
Mixed-Integer Vertex Covers on Bipartite Graphs
324(13)
Michele Conforti
Bert Gerards
Giacomo Zambelli
On the MIR Closure of Polyhedra
337(15)
Sanjeeb Dash
Oktay Gunluk
Andrea Lodi
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
352(15)
Michele Conforti
Marco Di Summa
Laurence A. Wolsey
Session 10
Simple Explicit Formula for Counting Lattice Points of Polyhedra
367(15)
Jean B. Lasserre
Eduardo S. Zeron
Characterizations of Total Dual Integrality
382(15)
Edwin O'Shea
Andras Sebo
Sign-Solvable Linear Complementarity Problems
397(13)
Naonori Kakimura
Session 11
An Integer Programming Approach for Linear Programs with Probabilistic Constraints
410(14)
James Luedtke
Shabbir Ahmed
George Nemhauser
Infrastructure Leasing Problems
424(15)
Barbara M. Anthony
Anupam Gupta
Robust Combinatorial Optimization with Exponential Scenarios
439(15)
Uriel Feige
Kamal Jain
Mohammad Mahdian
Vahab Mirrokni
Session 12
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
454(15)
Retsef Levi
Andrea Lodi
Maxim Sviridenko
Optimal Efficiency Guarantees for Network Design Mechanisms
469(15)
Tim Roughgarden
Mukund Sundararajan
The Set Connector Problem in Graphs
484(15)
Takuro Fukunaga
Hiroshi Nagamochi
Author Index 499