Integer Programming and Combinatorial Optimization 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings

Integer Programming and Combinatorial Optimization 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings / edited by Friedrich Eisenbrand, Bruce Shepherd.

Theidea ofa refereedconferencefor the mathematicalprogrammingcommunity was proposed by Ravi Kannan and William Pulleyblank to the Mathematical Programming Society (MPS) in the late 1980s. Thus IPCO was born, and MPS has sponsored the conference as one of its main events since IPCO I at the Universit...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Eisenbrand, Friedrich (Editor), Shepherd, Bruce (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edition:1st ed. 2010.
Series:Theoretical Computer Science and General Issues ; 6080
Springer eBook Collection.
Subjects:
Algorithms.
Computer science—Mathematics.
Computer graphics.
Data structures (Computer science).
Numerical analysis.
Computer communication systems.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • Solving LP Relaxations of Large-Scale Precedence Constrained Problems
  • Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
  • Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems
  • Restricted b-Matchings in Degree-Bounded Graphs
  • Zero-Coefficient Cuts
  • Prize-Collecting Steiner Network Problems
  • On Lifting Integer Variables in Minimal Inequalities
  • Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities
  • On Generalizations of Network Design Problems with Degree Bounds
  • A Polyhedral Study of the Mixed Integer Cut
  • Symmetry Matters for the Sizes of Extended Formulations
  • A 3-Approximation for Facility Location with Uniform Capacities
  • Secretary Problems via Linear Programming
  • Branched Polyhedral Systems
  • Hitting Diamonds and Growing Cacti
  • Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
  • A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs
  • Universal Sequencing on a Single Machine
  • Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
  • Integer Quadratic Quasi-polyhedra
  • An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs
  • An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
  • Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain
  • The Price of Collusion in Series-Parallel Networks
  • The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
  • A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
  • On Column-Restricted and Priority Covering Integer Programs
  • On k-Column Sparse Packing Programs
  • Hypergraphic LP Relaxations for Steiner Trees
  • Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
  • Efficient Algorithms for Average Completion Time Scheduling
  • Experiments with Two Row Tableau Cuts
  • An OPT?+?1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
  • On the Rank of Cutting-Plane Proof Systems.

Similar Items