product iamge

Combinatorial Optimization — Eureka, You Shrink!: Papers Dedicated to Jack Edmonds 5th International Workshop Aussois, France, March 5–9, 2001 Revised Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book is dedicated to Jack Edmonds in appreciation of his ground breaking work that laid the foundations for a broad variety of subsequent results achieved in combinatorial optimization.

The main part consists of 13 revised full papers on current topics in combinatorial optimization, presented at Aussois 2001, the Fifth Aussois Workshop on Combinatorial Optimization, March 5-9, 2001, and dedicated to Jack Edmonds.

Additional highlights in this book are an account of an Aussois 2001 special session dedicated to Jack Edmonds including a speech given by William R. Pulleyblank as well as newly typeset versions of three up-to-now hardly accessible classical papers:

- Submodular Functions, Matroids, and Certain Polyhedra
by Jack Edmonds

- Matching: A Well-Solved Class of Integer Linear Programs
by Jack Edmonds and Ellis L. Johnson

- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
by Jack Edmonds and Richard M. Karp.

Author(s): Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi (eds.)
Series: Lecture Notes in Computer Science 2570
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2003

Language: English
Pages: 214
Tags: Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Numeric Computing; Computer Graphics; Algorithms; Combinatorics

“Eureka — You Shrink!”....Pages 1-10
Submodular Functions, Matroids, and Certain Polyhedra....Pages 11-26
Matching: A Well-Solved Class of Integer Linear Programs....Pages 27-30
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems....Pages 31-33
Connected Matchings....Pages 34-38
Hajós’ Construction and Polytopes....Pages 39-47
Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection....Pages 48-63
Solving Real-World ATSP Instances by Branch-and-Cut....Pages 64-77
The Bundle Method for Hard Combinatorial Optimization Problems....Pages 78-88
The One-Commodity Pickup-and-Delivery Travelling Salesman Problem....Pages 89-104
Reconstructing a Simple Polytope from Its Graph....Pages 105-118
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming....Pages 119-133
A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope....Pages 134-146
Constructing New Facets of the Consecutive Ones Polytope....Pages 147-157
A Simplex-Based Algorithm for 0-1 Mixed Integer Programming....Pages 158-170
Mixed-Integer Value Functions in Stochastic Programming....Pages 171-184
Exact Algorithms for NP-Hard Problems: A Survey....Pages 185-207