Description 
1 online resource (xi, 475 pages) : illustrations 
Series 
Lecture notes in computer science, 03029743 ; 5035 

LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science ; 5035. 03029743


LNCS sublibrary. SL 1, Theoretical computer science and general issues.

Contents 
Session 1  Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables  Disjunctive Cuts for Nonconvex Mixed Integer Quadratically Constrained Programs  The Air Traffic Flow Management Problem: An Integer Optimization Approach  Session 2  The Induced Disjoint Paths Problem  A Weighted K t, t Free tFactor Algorithm for Bipartite Graphs  A New Algorithm for the Maximum Weighted Stable Set Problem in ClawFree Graphs  A Polynomial Algorithm for Weighted Abstract Flow  Session 3  A Comparative Study of Linear and Semidefinite BranchandCut Methods for Solving the Minimum Graph Bisection Problem  Binary Positive Semidefinite Matrices and Associated Integer Polytopes  Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities  Session 4  Tight Bounds for Permutation Flow Shop Scheduling  The Stochastic Machine Replenishment Problem  A Polynomial Time Approximation Scheme for the Square Packing Problem  Session 5  Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints  Computing with Multirow Gomory Cuts  Constraint Orbital Branching  Session 6  A Fast, Simpler Algorithm for the Matroid Parity Problem  Degree Bounded Matroids and Submodular Flows  Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle  Session 7  PrimalDual Schema for Capacitated Covering Problems  Offline and Online Facility Leasing  Importance Sampling via LoadBalanced Facility Location  Session 8  A Constant Approximation Algorithm for the a priori Traveling Salesman Problem  New GeometryInspired Relaxations and Algorithms for the Metric Steiner Tree Problem  Min Sum Edge Coloring in Multigraphs Via Configuration LP  Session 9  An Improved Algorithm for Finding Cycles Through Elements  The Stable Roommates Problem with Choice Functions  A New Approach to SplittingOff  Session 10  Can Pure Cutting Plane Algorithms Work?  The Mixing Set with Divisible Capacities  A Polynomial Time Algorithm for the Stochastic Uncapacitated LotSizing Problem with Backlogging  Lifting Integer Variables in Minimal Inequalities Corresponding to LatticeFree Triangles 
Summary 
This book constitutes the refereed proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2008, held in Bertinoro, Italy, in May 2008. The 32 revised full papers presented were carefully reviewed and selected from 95 submissions. The papers cover various aspects of integer programming and combinatorial optimization and present recent developments in theory, computation, and applications in that area. Topics included are such as approximation algorithms, branch and bound algorithms, branch and cut algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, online algorithms and competitive analysis, polyhedral combinatorics, randomized algorithms, random graphs, scheduling theory and scheduling algorithms, and semidefinite programs 
Bibliography 
Includes bibliographical references and index 
Notes 
Print version record 
Subject 
Integer programming  Congresses.


Combinatorial optimization  Congresses.

Genre/Form 
Conference papers and proceedings.


Conference papers and proceedings.

Form 
Electronic book

Author 
Lodi, Andrea.


Panconesi, Alessandro.


Rinaldi, Giovanni.

ISBN 
9783540688914 

3540688919 

9783540688860 (paperback) 

3540688862 (paperback) 
