| Description |
1 online resource (xi, 400 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 7801 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7801.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
On the Structure of Reduced Kernel Lattice Bases / Karen Aardal, Frederik von Heymann -- All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns / Ron Adany, Moran Feldman, Elad Haramaty -- Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path / Aris Anagnostopoulos, Fabrizio Grandoni -- Intersection Cuts for Mixed Integer Conic Quadratic Sets / Kent Andersen, Anders Nedergaard Jensen -- Content Placement via the Exponential Potential Function Method / David Applegate, Aaron Archer -- Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case / Amitabh Basu, Robert Hildebrand -- Blocking Optimal Arborescences / Attila Bernáth, Gyula Pap -- Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property / Flavia Bonomo, Gianpaolo Oriolo -- A Complexity and Approximability Study of the Bilevel Knapsack Problem / Alberto Caprara, Margarida Carvalho -- Matroid and Knapsack Center Problems / Danny Z. Chen, Jian Li, Hongyu Liang |
|
Cut-Generating Functions / Michele Conforti, Gérard Cornuéjols -- Reverse Chvátal-Gomory Rank / Michele Conforti, Alberto Del Pia -- On Some Generalizations of the Split Closure / Sanjeeb Dash, Oktay Günlük -- Packing Interdiction and Partial Covering Problems / Michael Dinitz, Anupam Gupta -- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators / Hongbo Dong, Jeff Linderoth -- An Improved Integrality Gap for Asymmetric TSP Paths / Zachary Friggstad, Anupam Gupta, Mohit Singh -- Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids / Bertrand Guenin, Leanne Stuive -- A Stochastic Probing Problem with Applications / Anupam Gupta, Viswanath Nagarajan -- Thrifty Algorithms for Multistage Robust Optimization / Anupam Gupta, Viswanath Nagarajan -- Shallow-Light Steiner Arborescences with Vertex Delays / Stephan Held, Daniel Rotter -- Two Dimensional Optimal Mechanism Design for a Sequencing Problem / Ruben Hoeksma, Marc Uetz |
|
Advances on Matroid Secretary Problems: Free Order Model and Laminar Case / Patrick Jaillet, José A. Soto -- A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets / Diego Alejandro Morán Ramírez -- The Complexity of Scheduling for p-Norms of Flow and Stretch / Benjamin Moseley, Kirk Pruhs, Cliff Stein -- The Euclidean k-Supplier Problem / Viswanath Nagarajan, Baruch Schieber -- Facial Structure and Representation of Integer Hulls of Convex Sets / Vishnu Narayanan -- An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem / Tim Nonner, Maxim Sviridenko -- Chain-Constrained Spanning Trees / Neil Olver, Rico Zenklusen -- A Simpler Proof for O(Congestion+Dilation) Packet Routing / Thomas Rothvoß -- 0/1 Polytopes with Quadratic Chvátal Rank / Thomas Rothvoß, Laura Sanitá -- Eight-Fifth Approximation for the Path TSP / András Sebő -- Fast Deterministic Algorithms for Matrix Completion Problems / Tasuku Soma -- Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines / Maxim Sviridenko, Andreas Wiese |
| Summary |
This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaí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 |
| Analysis |
Computer science |
|
Computer software |
|
Electronic data processing |
|
Computational complexity |
|
Numeric Computing |
|
Algorithm Analysis and Problem Complexity |
|
Discrete Mathematics in Computer Science |
|
computerwetenschappen |
|
computer sciences |
|
numerieke methoden |
|
numerical methods |
|
computertechnieken |
|
computer techniques |
|
wiskunde |
|
mathematics |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Notes |
International conference proceedings |
|
Includes author index |
| Bibliography |
With bibliographical references and index |
| Notes |
English |
|
Print version record |
| In |
Springer eBooks |
| Subject |
Integer programming -- Congresses
|
|
Combinatorial optimization -- Congresses
|
|
Software
|
|
software.
|
|
Combinatorial optimization
|
|
Integer programming
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Software.
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Goemans, Michel, editor
|
|
Correa, José, editor
|
| ISBN |
9783642366949 |
|
3642366945 |
|
3642366937 |
|
9783642366932 |
|
