Integer Programming and Combinatorial Optimization 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Lodi, Andrea (Επιμελητής έκδοσης), Panconesi, Alessandro (Επιμελητής έκδοσης), Rinaldi, Giovanni (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 5035
• Θέματα: Computer science.; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Computer graphics.; Computer Science.; Discrete Mathematics in Computer Science.; Numeric Computing.; Algorithm Analysis and Problem Complexity.; Computer Graphics.

The volume contains the papers selected for presentation at IPCO 2008, the 13th International Conference on Integer Programming and Combinatorial - timization that was held in Bertinoro (Italy), May 26–28, 2008. The IPCO series of conferences, sponsored by the Mathematical Progr- ming Society, highl...

Πίνακας περιεχομένων:

• Session 1
• Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
• Disjunctive Cuts for Non-convex 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 t-Factor Algorithm for Bipartite Graphs
• A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
• A Polynomial Algorithm for Weighted Abstract Flow
• Session 3
• A Comparative Study of Linear and Semidefinite Branch-and-Cut 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 Multi-row 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
• Primal-Dual Schema for Capacitated Covering Problems
• Offline and Online Facility Leasing
• Importance Sampling via Load-Balanced Facility Location
• Session 8
• A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
• New Geometry-Inspired 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 Splitting-Off
• Session 10
• Can Pure Cutting Plane Algorithms Work?
• The Mixing Set with Divisible Capacities
• A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
• Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles.