Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Integer Programming and Combinatorial Optimization: 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings > Improved Approximation Algorithms for Capacitated Facility Location Problems
Integer Programming and Combinatorial Optimization: 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings |
Gérard Cornuéjols; Rainer E. Burkard; Gerhard J. Woeginger
Springer Berlin Heidelberg
Integer Programming and Combinatorial Optimization: 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings
Improved Approximation Algorithms for Capacitated Facility Location Problems
Authors

Fabián A. Chudak; David P. Williamson

ARI Id

1674219950720_4245112

Access

Not Available Free

Pages

99-113

DOI

10.1007/3-540-48777-8_8

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-48777-8_8

Table of Contents of Book
Showing 1 to 20 of 35 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-IX
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
Karen Aardal; Robert E. Bixby; Cor A. J. Hurkens; Arjen K. Lenstra; Job W. Smeltink
1-16
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
Alexander A. Ageev; Maxim I. Sviridenko
17-30
Solving the Convex Cost Integer Dual Network Flow Problem
Ravindra K. Ahuja; Dorit S. Hochbaum; James B. Orlin
31-44
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem
Edoardo Amaldi; Marc E. Pfetsch; Leslie E. Trotter Jr.
45-59
Valid Inequalities for Problems with Additive Variable Upper Bounds
Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh
60-72
A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version)
Mao-cheng Cai; Xiaotie Deng; Wenan Zang
73-86
On the Separation of Maximally Violated mod-k Cuts
Alberto Caprara; Matteo Fischetti; Adam N. Letchford
87-98
Improved Approximation Algorithms for Capacitated Facility Location Problems
Fabián A. Chudak; David P. Williamson
99-113
Optimal 3-Terminal Cuts and Linear Programming
William H. Cunningham; Lawrence Tang
114-125
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
Dragoš Cvetković; Mirjana Čangalović; Vera Kovačević-Vujčić
126-136
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
Friedrich Eisenbrand; Andreas S. Schulz
137-150
Universally Maximum Flow with Piecewise-Constant Capacities
Lisa Fleischer
151-165
Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope
Jean Fonlupt; Ali Ridha Mahjoub
166-182
An Orientation Theorem with Parity Conditions
András Frank; Tibor Jordán; Zoltán Szigeti
183-190
Parity Constrained k-Edge-Connected Orientations
András Frank; Zoltán Király
191-201
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Eran Halperin; Uri Zwick
202-217
On the Chvátal Rank of Certain Inequalities
Mark Hartmann; Maurice Queyranne; Yaoguang Wang
218-233
The Square-Free 2-Factor Problem in Bipartite Graphs
David Hartvigsen
234-241
The m-Cost ATSP
Christoph Helmberg
242-258
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 35 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings