Research Catalog

Title

Computational combinatorial optimization : optimal or provably near-optimal solutions / Michael Jünger, Denis Naddef (eds.).

Publication

Berlin ; New York : Springer, c2001.

Items in the Library & Off-site

Details

Additional Authors

• Jünger, M. (Michael)
• Naddef, Denis, 1947-

Description

viii, 303 p.; 24 cm.

Series Statement

Lecture notes in computer science, 0302-9743 ; 2241

Subject

• Programming (Mathematics) > Congresses
• Combinatorial optimization > Congresses

Bibliography (note)

• Includes bibliographical references and index.

Additional Formats (note)

• Also available via the World Wide Web.

Contents

General mixed integer programming : computational issues for branch-and-cut algorithms / Alexander Martin -- Projection and lifting in combinatorial optimization / Egon Balas -- Mathematical programming models and formulations for deterministic production planning problems / Yves Pochet -- Lagrangian relaxation / Claude Lemaréchal -- Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS / Matthias Elf ... [et al.] -- Branch, cut, and price : sequential and parallel / Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter, Jr. -- TSP cuts which do not conform to the template paradigm / David Applegate, Robert Bixby, Vašek Chvátal.

Call Number

JSE 02-246

ISBN

3540428771 (softcover : alk. paper)

LCCN

2001057557

OCLC

48449671

Title

Computational combinatorial optimization : optimal or provably near-optimal solutions / Michael Jünger, Denis Naddef (eds.).

Imprint

Berlin ; New York : Springer, c2001.

Series

Lecture notes in computer science, 0302-9743 ; 2241

Bibliography

Includes bibliographical references and index.

Additional Formats

Also available via the World Wide Web.

Connect to:

Restricted to Springer LINK subscribers

Added Author

Jünger, M. (Michael)

Naddef, Denis, 1947-

Research Call Number

JSE 02-246