Research Catalog

Title

Integer programming and combinatorial optimization : 4th International Conference, IPCO '95, Copenhagen, Denmark, May 1995 : proceedings / Egon Balas, Jens Clausen (eds.).

Author

Conference on Integer Programming and Combinatorial Optimization (4th : 1995 : Copenhagen, Denmark)

Publication

Berlin ; New York : Springer-Verlag, [1995], ©1995.

Items in the Library & Off-site

Holdings

Details

Additional Authors

• Balas, Egon.
• Clausen, Jens, 1950-

Description

x, 461 pages : illustrations; 24 cm.

Series Statement

Lecture notes in computer science ; 920

Uniform Title

Lecture notes in computer science ; 920.

Subject

• Integer programming > Congresses
• Combinatorial optimization > Congresses

Bibliography (note)

• Includes bibliographical references and index.

Contents

• Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION / A. Frieze and M. Jerrum -- Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs / G. Even, J. Naor, B. Schieber and M. Sudan -- Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems / D. Bertsimas, C. Teo and R. Vohra -- Separating Clique Type and Bipartition Inequalities in Polynomial Time / R. D. Carr -- The Interval Order Polytope of a Digraph / R. Muller and A. S. Schulz -- Separation Problems for the Stable Set Polytope / E. Cheng and W. H. Cunningham -- Computational Study of a Family of Mixed-Integer Quadratic Programming Problems / D. Bienstock -- A Minimal Algorithm for the Bounded Knapsack Problem / D. Pisinger -- A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems / L. F. Escudero, S. Martello and P. Toth -- Combining Semidefinite and Polyhedral Relaxations for Integer Programs / C. Helmberg, S. Poljak, F. Rendl and H. Wolkowicz.
• Distributed Near-Optimal Matching / X. Deng -- The Random Linear Bottleneck Assignment Problem / U. Pferschy -- On Implementing Push-Relabel Method for the Maximum Flow Problem / B. V. Cherkassky and A. V. Goldberg -- Use of Hidden Network Structure in the Set Partitioning Problem / A. I. Ali, H.-S. Han and J. L. Kennington -- Generalized Max Flows and Augmenting Paths / D. Hartvigsen -- Oriented Matroid Polytopes and Polyhedral Fans are Signable / P. Kleinschmidt and S. Onn -- On Combinatorial Properties of Binary Spaces / B. Noviek and A. Sebo -- Coverings and Delta-Coverings / A. Bouchet -- The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case / I. Barany, H. E. Scarf and D. Shallcross -- The Hilbert Basis of the Cut Cone over the Complete Graph K[subscript 6] / F. Laburthe -- GRIN: An Implementation of Grobner Bases for Integer Programming / S. Hosten and B. Sturmfels.
• Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results / Y. Crama and F. C. R. Spieksma -- Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times / H. Hoogeveen and S. van de Velde -- Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds / M. Queyranne and A. S. Schutz -- A Mickey-Mouse Decomposition Theorem / M. Conforti, G. Cornuejols, A. Kapoor and K. Vuskovic -- Minimum Cost Dynamic Flows: The Series-Parallel Case / B. Klinz and G. J. Woeginger -- [actual symbol not reproducible] Ideal Matrices / P. Nobili and A. Sassano -- Embedding Graphs in the Torus in Linear Time / M. Juvan, J. Marincek and B. Mohar -- A Characterization of Seymour Graphs / A. A. Ageev, A. V. Kostochka and Z. Szigeti -- The Markov Chain of Colourings / J. E. Bartels and D. J. A. Welsh -- Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs / H. N. Gabow and K. S. Manu.
• A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem / H. Nagamochi and T. Ibaraki -- How to Make a Strongly Connected Digraph Two-Connected / A. Frank and T. Jordan -- Polyhedra and Optimization in Connection with a Weak Majorization Ordering / G. Dahl -- Combining and Strengthening Gomory Cuts / S. Ceria, G. Cornuejols and N. Dawande -- Sequence Independent Lifting of Cover Inequalities / Z. Gu, G. L. Nemhauser and M. W. P. Savelsbergh.

ISBN

0387594086 (U.S. : acid-free paper)

LCCN

95017870

OCLC

ocm32429806

Owning Institutions

Columbia University Libraries