Screen LibraryInteger programming and combinatorial optimization : 16th International Conference, IPCO 2013, Valparai so, Chile, March 18-20, 2013. Proceedings /
This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparai so, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for...
Saved in:
| Corporate Authors: | ; |
|---|---|
| Group Author: | ; |
| Published: |
Springer,
|
| Publisher Address: | Berlin ; New York : |
| Publication Dates: | 2013. |
| Literature type: | eBook |
| Language: | English |
| Series: |
Lecture notes in computer science ; 7801. LNCS sublibrary. SL 1, Theoretical computer science and general issues. |
| Subjects: | |
| Online Access: |
http://dx.doi.org/10.1007/978-3-642-36694-9 |
| Summary: |
This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparai so, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems. |
| Item Description: |
International conference proceedings. Includes author index. |
| Carrier Form: | 1 online resource (xi, 400 pages) : illustrations. |
| Bibliography: | With bibliographic references and index. |
| ISBN: |
9783642366949 (electronic bk.) 3642366945 (electronic bk.) 3642366937 (print) 9783642366932 (print) |
| Index Number: | T57 |
| CLC: | TP311.5-532 |
| Contents: |
On the Structure of Reduced Kernel Lattice Bases / All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns / Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path / Intersection Cuts for Mixed Integer Conic Quadratic Sets / Content Placement via the Exponential Potential Function Method / Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case / Blocking Optimal Arborescences / Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property / A Complexity and Approximability Study of the Bilevel Knapsack Problem / Matroid and Knapsack Center Problems / Cut-Generating Functions / Reverse Chva tal-Gomory Rank / On Some Generalizations of the Split Closure / Packing Interdiction and Partial Covering Problems / On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators / An Improved Integrality Gap for Asymmetric TSP Paths / Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids / A Stochastic Probing Problem with Applications / Thrifty Algorithms for Multistage Robust Optimization / Shallow-Light Steiner Arborescences with Vertex Delays / Two Dimensional Optimal Mechanism Design for a Sequencing Problem / Advances on Matroid Secretary Problems: Free Order Model and Laminar Case / A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets / The Complexity of Scheduling for p-Norms of Flow and Stretch / The Euclidean k-Supplier Problem / Facial Structure and Representation of Integer Hulls of Convex Sets / An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem / Chain-Constrained Spanning Trees / A Simpler Proof for O(Congestion+Dilation) Packet Routing / 0/1 Polytopes with Quadratic Chva tal Rank / Eight-Fifth Approximation for the Path TSP / Fast Deterministic Algorithms for Matrix Completion Problems / Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines / |