Description |
1 online resource (xi, 484 pages) : illustrations |
Series |
Lecture notes in computer science, 0302-9743 ; 3509 |
|
Lecture notes in computer science ; 3509.
|
Contents |
Mixed-Integer Cuts from Cyclic Groups -- Optimizing over the First Chvàtal Closure -- Sequential Pairing of Mixed Integer Inequalities -- Approximate Min-max Relations for Odd Cycles in Planar Graphs -- Disjoint Cycles: Integrality Gap, Hardness, and Approximation -- A Combinatorial Algorithm to Find a Maximum Even Factor -- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems -- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem -- Inventory and Facility Location Models with Market Selection -- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations -- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials -- Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcutand Graph Coloring -- On the Inefficiency of Equilibria in Congestion Games -- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times -- LP-Based Online Scheduling: From Single to Parallel Machines -- Unique Sink Orientations of Grids -- Jumping Doesn't Help in Abstract Cubes -- Computing the Inertia from Sign Patterns -- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem -- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem -- Smoothed Analysis of Integer Programming -- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs -- Approximation Algorithms for Stochastic Inventory Control Models -- On Two-Stage Stochastic Minimum Spanning Trees -- Combinatorial Analysis of Generic Matrix Pencils -- Power Optimization for Connectivity Problems -- Packing Steiner Forests -- Bidimensional Packing by Bilinear Programming -- On the L???-Norm of Extreme Points for Crossing Supermodular Directed Network LPs -- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks -- Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem -- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems -- A Study of Domino-Parity and k-Parity Constraints for the TSP -- Not Every GTSP Facet Induces an STSP Facet |
Summary |
"This volume compiles the papers presented at IPCO XI, the eleventh conference in this series, held June 8 -10, 2005, at the Technische Universitat Berlin." |
Analysis |
IPCO |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
computergrafie |
|
computer graphics |
|
wiskunde |
|
mathematics |
|
computertechnieken |
|
computer techniques |
|
computerwetenschappen |
|
computer sciences |
|
numerieke methoden |
|
numerical methods |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
Bibliography |
Includes bibliographical references and index |
Notes |
Print version record |
Subject |
Integer programming -- Congresses
|
|
Combinatorial optimization -- Congresses
|
|
MATHEMATICS -- Linear & Nonlinear Programming.
|
|
Combinatorial optimization.
|
|
Integer programming -- Congresses.
|
|
Informatique.
|
|
Combinatorial optimization.
|
|
Integer programming.
|
Genre/Form |
Conference papers and proceedings.
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
Form |
Electronic book
|
Author |
Jünger, M. (Michael)
|
|
Kaibel, Volker.
|
ISBN |
9783540321026 |
|
3540321020 |
|
3540261990 |
|
9783540261995 |
|