| Description |
1 online resource (xiii, 432 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 6655 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 6655. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Machine generated contents note: Excluded Minor Characterization of Seymour Graphs / Zoltan Szigeti -- Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes / Levent Tuncel -- Probabilistic Analysis of the Strength of the Split and Triangle Closures / Marco Molinaro -- Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation / Emiliano Traversi -- Lift-and-Project Cuts for Mixed Integer Convex Programs / Pierre Bonami -- TSP on Cubic and Subcubic Graphs / Leen Stougie -- Approximability of Capacitated Network Design / Nitish Korula -- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems / Chaitanya Swamy -- Exact Rational Mixed-Integer Programming Solver / Kati Wolter -- Valid Inequalities for the Pooling Problem with Binary Variables / James Luedtke -- On the Chvatal-Gomory Closure of a Compact Convex Set / |
|
Note continued: Constructing Extended Formulations from Reflection Relations / Kanstantsin Pashkovich -- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack / C. Thach Nguyen -- Degree Bounded Forest Covering / Lap Chi Lau -- Primal-Dual Algorithm for Weighted Abstract Cut Packing / Britta Peis -- Convexification Techniques for Linear Complementarity Constraints / Jean-Philippe P. Richard -- Iterative Packing for Demand and Hypergraph Matching / Ojas Parekh -- Universal Packet Routing with Arbitrary Bandwidths and Transit Times / Andreas Wiese -- Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems / Gunther R. Raidl -- Jump Number of Two-Directional Orthogonal Ray Graphs / Claudio Telha -- Optimal Matching Forests and Valuated Delta-Matroids / Kenjiro Takazawa -- Fixed-Charge Transportation on a Path: Linear Programming Formulations / Mathieu Van Vyve |
| Summary |
Annotation This book constitutes the proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011, held in New York, USA in June 2011. The 33 papers presented were carefully reviewed and selected from 110 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 |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| Subject |
Integer programming -- Congresses
|
|
Combinatorial optimization -- Congresses
|
|
Informatique.
|
|
Combinatorial optimization
|
|
Integer programming
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Günlük, Oktay
|
|
Woeginger, Gerhard.
|
| ISBN |
9783642208072 |
|
364220807X |
|
