Library of American University of Madaba
Your cart is empty.
Eisenbrand, Friedrich.
Integer Programming and Combinatorial Optimization 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings / [electronic resource] : edited by Friedrich Eisenbrand, F. Bruce Shepherd. - XIII, 466p. 45 illus. online resource. - Lecture Notes in Computer Science, 6080 0302-9743 ; .
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.
This book constitutes the proceedings of the 14th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2010, held in Lausanne, Switzerland in June 2010. The 34 papers presented were carefully reviewed and selected from 135 submissions. The conference has become the main forum for recent results in integer programming and combinatorial optimization in the non-symposium years.
9783642130366
Computer science.
Computer Communication Networks.
Data structures (Computer science).
Computer software.
Electronic data processing.
Computational complexity.
Computer graphics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Computer Graphics.
Data Structures.
Numeric Computing.
Computer Communication Networks.
QA76.9.A43
005.1
Integer Programming and Combinatorial Optimization 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings / [electronic resource] : edited by Friedrich Eisenbrand, F. Bruce Shepherd. - XIII, 466p. 45 illus. online resource. - Lecture Notes in Computer Science, 6080 0302-9743 ; .
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.
This book constitutes the proceedings of the 14th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2010, held in Lausanne, Switzerland in June 2010. The 34 papers presented were carefully reviewed and selected from 135 submissions. The conference has become the main forum for recent results in integer programming and combinatorial optimization in the non-symposium years.
9783642130366
Computer science.
Computer Communication Networks.
Data structures (Computer science).
Computer software.
Electronic data processing.
Computational complexity.
Computer graphics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Computer Graphics.
Data Structures.
Numeric Computing.
Computer Communication Networks.
QA76.9.A43
005.1