Coverart for item
The Resource Integer programming and combinatorial optimization : 8th International IPCO Conference, Utrecht, the Netherlands, June 13-15, 2001 : proceedings, Karen Aardal, Bert Gerards (eds.)

Integer programming and combinatorial optimization : 8th International IPCO Conference, Utrecht, the Netherlands, June 13-15, 2001 : proceedings, Karen Aardal, Bert Gerards (eds.)

Label
Integer programming and combinatorial optimization : 8th International IPCO Conference, Utrecht, the Netherlands, June 13-15, 2001 : proceedings
Title
Integer programming and combinatorial optimization
Title remainder
8th International IPCO Conference, Utrecht, the Netherlands, June 13-15, 2001 : proceedings
Statement of responsibility
Karen Aardal, Bert Gerards (eds.)
Creator
Contributor
Subject
Genre
Language
eng
Member of
Additional physical form
Also available by subscription via the World Wide Web.
Cataloging source
DLC
Dewey number
519.7/7
Illustrations
illustrations
Index
index present
LC call number
T57.74
LC item number
.C625 2001
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2001
http://bibfra.me/vocab/lite/meetingName
Conference on Integer Programming and Combinatorial Optimization
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Aardal, K.
  • Gerards, A. M. H
Series statement
Lecture notes in computer science,
Series volume
2081
http://library.link/vocab/subjectName
  • Integer programming
  • Combinatorial optimization
Label
Integer programming and combinatorial optimization : 8th International IPCO Conference, Utrecht, the Netherlands, June 13-15, 2001 : proceedings, Karen Aardal, Bert Gerards (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Two O(log[superscript *][kappa])-Approximation Algorithms for the Asymmetric [kappa]-Center Problem / A. Archer -- Strongly Polynomial Algorithms for the Unsplittable Flow Problem / Y. Azar and O. Regev -- Edge Covers of Setpairs and the Iterative Rounding Method / J. Cheriyan and S. Vempala -- The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates / C.-F. M. Chou, M. Queyranne and D. Simchi-Levi -- Approximate [kappa]-MSTs and [kappa]-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation / F. A. Chudak, T. Roughgarden and D. P. Williamson -- On the Rank of Mixed 0,1 Polyhedra / G. Cornuejols and Y. Li -- Fast 2-Variable Integer Programming / F. Eisenbrand and G. Rote -- Approximating [kappa]-Spanner Problems for [kappa] > 2 / M. Elkin and D. Peleg -- A Matroid Generalization of the Stable Matching Polytope / T. Fleiner -- A 2-Approximation for Minimum Cost {0,1,2} Vertex Connectivity / L. Fleischer -- Combined Connectivity Augmentation and Orientation Problems / A. Frank and T. Kiraly -- An Extension of Theorem of Henneberg and Laman / A. Frank and L. Szego -- Bisubmodular Function Minimization / S. Fujishige and S. Iwata -- On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem / N. Garg, R. Khandekar and G. Konjevod / [et al.] -- Circuit Mengerian Directed Graphs / B. Guenin -- Integral Polyhedra Related to Even Cycle and Even Cut Matroids / B. Guenin -- A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems / E. Halperin and U. Zwick -- Synthesis of 2-Commodity Flow Networks / R. Hassin and A. Levin -- Bounds for Deterministic Periodic Routing Sequences / A. Hordijk and D. A. van der Laan -- Cutting Planes for Mixed 0-1 Semidefinite Programs / G. Iyengar and M. T. Cezik -- Independence Free Graphs and Vertex Connectivity Augmentation / B. Jackson and T. Jordan -- The Throughput of Sequential Testing / M. S. Kodialam -- An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs / J. B. Lasserre -- Pruning by Isomorphism in Branch-and-Cut / F. Margot -- Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times / A. J. Miller, G. L. Nemhauser and M. W. P. Savelsbergh -- Fences Are Futile: On Relaxations for the Linear Ordering Problem / A. Newman and S. Vempala -- Generating Cuts from Multiple-Term Disjunctions / M. Perregaard and E. Balas -- A (2+[epsilon])-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective / M. Queyranne and M. Sviridenko -- Performance Guarantees to Local Search for Multiprocessor Scheduling / P. Schuurman and T. Vredeveld -- Connected Joins in Graphs / A. Sebo and E. Tannier -- Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines / R. Sitters -- Approximation Algorithms for the Minimum Bends Traveling Salesman Problem / C. Stein and D. P. Wagner
Control code
47136671
Dimensions
24 cm
Dimensions
unknown
Extent
xi, 421 pages
Isbn
9783540422259
Isbn Type
(pbk. : alk. paper)
Lccn
2001041094
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Other physical details
illustrations
Sound
unknown sound
Specific material designation
remote
Label
Integer programming and combinatorial optimization : 8th International IPCO Conference, Utrecht, the Netherlands, June 13-15, 2001 : proceedings, Karen Aardal, Bert Gerards (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Two O(log[superscript *][kappa])-Approximation Algorithms for the Asymmetric [kappa]-Center Problem / A. Archer -- Strongly Polynomial Algorithms for the Unsplittable Flow Problem / Y. Azar and O. Regev -- Edge Covers of Setpairs and the Iterative Rounding Method / J. Cheriyan and S. Vempala -- The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates / C.-F. M. Chou, M. Queyranne and D. Simchi-Levi -- Approximate [kappa]-MSTs and [kappa]-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation / F. A. Chudak, T. Roughgarden and D. P. Williamson -- On the Rank of Mixed 0,1 Polyhedra / G. Cornuejols and Y. Li -- Fast 2-Variable Integer Programming / F. Eisenbrand and G. Rote -- Approximating [kappa]-Spanner Problems for [kappa] > 2 / M. Elkin and D. Peleg -- A Matroid Generalization of the Stable Matching Polytope / T. Fleiner -- A 2-Approximation for Minimum Cost {0,1,2} Vertex Connectivity / L. Fleischer -- Combined Connectivity Augmentation and Orientation Problems / A. Frank and T. Kiraly -- An Extension of Theorem of Henneberg and Laman / A. Frank and L. Szego -- Bisubmodular Function Minimization / S. Fujishige and S. Iwata -- On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem / N. Garg, R. Khandekar and G. Konjevod / [et al.] -- Circuit Mengerian Directed Graphs / B. Guenin -- Integral Polyhedra Related to Even Cycle and Even Cut Matroids / B. Guenin -- A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems / E. Halperin and U. Zwick -- Synthesis of 2-Commodity Flow Networks / R. Hassin and A. Levin -- Bounds for Deterministic Periodic Routing Sequences / A. Hordijk and D. A. van der Laan -- Cutting Planes for Mixed 0-1 Semidefinite Programs / G. Iyengar and M. T. Cezik -- Independence Free Graphs and Vertex Connectivity Augmentation / B. Jackson and T. Jordan -- The Throughput of Sequential Testing / M. S. Kodialam -- An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs / J. B. Lasserre -- Pruning by Isomorphism in Branch-and-Cut / F. Margot -- Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times / A. J. Miller, G. L. Nemhauser and M. W. P. Savelsbergh -- Fences Are Futile: On Relaxations for the Linear Ordering Problem / A. Newman and S. Vempala -- Generating Cuts from Multiple-Term Disjunctions / M. Perregaard and E. Balas -- A (2+[epsilon])-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective / M. Queyranne and M. Sviridenko -- Performance Guarantees to Local Search for Multiprocessor Scheduling / P. Schuurman and T. Vredeveld -- Connected Joins in Graphs / A. Sebo and E. Tannier -- Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines / R. Sitters -- Approximation Algorithms for the Minimum Bends Traveling Salesman Problem / C. Stein and D. P. Wagner
Control code
47136671
Dimensions
24 cm
Dimensions
unknown
Extent
xi, 421 pages
Isbn
9783540422259
Isbn Type
(pbk. : alk. paper)
Lccn
2001041094
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Other physical details
illustrations
Sound
unknown sound
Specific material designation
remote

Library Locations

    • Thomas Jefferson LibraryBorrow it
      1 University Blvd, St. Louis, MO, 63121, US
      38.710138 -90.311107
Processing Feedback ...