AlegendsaysthatJackEdmondsshouted"Eureka-youshrink!"whenhefound a good characterization for matching (and the matching algorithm) in 1963, the daybeforehistalkatasummerworkshopatRANDCorporationwithcelebrities like George Dantzig, Ralph Gomory, and Alan Ho?man in the audience. During Aussois 2001, Jack con?rmed: "'Eureka - you shrink!' is really true, except that instead of 'Eureka' it maybe was some less digni?ed word." Aussois 2001 was the ?fth in an annual series of workshops on combinatorial optimization that are alternately organized by Thomas Liebling, Denis Naddef, andLaurenceWolsey-theinitiatorsofthisseries-inevenyearsandtheeditors of this book in odd years (except 1997). We decided to dedicate Aussois 2001 to Jack Edmonds in appreciation of his groundbreaking work that laid the foundations of much of what combinatorial optimizers have done in the last 35 years. Luckily, Jack is a regular participant of the Aussois workshops and, as ever, he cares a lot for young combinatorial optimizers who traditionally play a major r^ ole in the Aussois series. Fig.1. Handout for the Aussois 2001 participants VI Preface Highlights of Aussois 2001 included a special session entitled "Eureka - you shrink!" in honor of Jack and a special lecture by Jack on "Submodular Fu- tions, Matroids, and Certain Polyhedra" that closed the workshop. In this book, we give an account of the "Eureka - you shrink!" session as well as reprints of three hardly accessible papers that Jack gave as a handout to the Aussois 2001 participants and that were originally published in theProceedings oftheCalgaryInternationalConferenceonCombinatorialStructuresandTheir Applications 1969, Gordon and Breach (1970) - newly typeset by the editors and reprinted by permission.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 1803065
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -AlegendsaysthatJackEdmondsshouted Eureka youshrink! whenhefound a good characterization for matching (and the matching algorithm) in 1963, the daybeforehistalkatasummerworkshopatRANDCorporationwithcelebrities like George Dantzig, Ralph Gomory, and Alan Ho man in the audience. During Aussois 2001, Jack con rmed: Eureka you shrink! is really true, except that instead of Eureka it maybe was some less digni ed word. Aussois 2001 was the fth in an annual series of workshops on combinatorial optimization that are alternately organized by Thomas Liebling, Denis Naddef, andLaurenceWolsey theinitiatorsofthisseries inevenyearsandtheeditors of this book in odd years (except 1997). We decided to dedicate Aussois 2001 to Jack Edmonds in appreciation of his groundbreaking work that laid the foundations of much of what combinatorial optimizers have done in the last 35 years. Luckily, Jack is a regular participant of the Aussois workshops and, as ever, he cares a lot for young combinatorial optimizers who traditionally play a major r ole in the Aussois series. Fig.1. Handout for the Aussois 2001 participants VI Preface Highlights of Aussois 2001 included a special session entitled Eureka you shrink! in honor of Jack and a special lecture by Jack on Submodular Fu- tions, Matroids, and Certain Polyhedra that closed the workshop. In this book, we give an account of the Eureka you shrink! session as well as reprints of three hardly accessible papers that Jack gave as a handout to the Aussois 2001 participants and that were originally published in theProceedings oftheCalgaryInternationalConferenceonCombinatorialStructuresandTheir Applications 1969, Gordon and Breach (1970) newly typeset by the editors and reprinted by permission. 224 pp. Englisch. N° de réf. du vendeur 9783540005803
Quantité disponible : 2 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 1803065-n
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 1803065-n
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 1803065
Quantité disponible : Plus de 20 disponibles
Vendeur : moluna, Greven, Allemagne
Kartoniert / Broschiert. Etat : New. N° de réf. du vendeur 4877228
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 'Eureka - You Skrink!'.- 'Eureka - You Shrink!'.- Submodular Functions, Matroids, and Certain Polyhedra.- Matching: A Well-Solved Class of Integer Linear Programs.- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.- Connected Matchings.- Hajós' Construction and Polytopes.- Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection.- Solving Real-World ATSP Instances by Branch-and-Cut.- The Bundle Method for Hard Combinatorial Optimization Problems.- The One-Commodity Pickup-and-Delivery Travelling Salesman Problem.- Reconstructing a Simple Polytope from Its Graph.- An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.- A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope.- Constructing New Facets of the Consecutive Ones Polytope.- A Simplex-Based Algorithm for 0-1 Mixed Integer Programming.- Mixed-Integer Value Functions in Stochastic Programming.- Exact Algorithms for NP-Hard Problems: A Survey. N° de réf. du vendeur 9783540005803
Quantité disponible : 1 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -'Eureka - You Skrink!'.- 'Eureka - You Shrink!'.- Submodular Functions, Matroids, and Certain Polyhedra.- Matching: A Well-Solved Class of Integer Linear Programs.- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.- Connected Matchings.- Hajós' Construction and Polytopes.- Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection.- Solving Real-World ATSP Instances by Branch-and-Cut.- The Bundle Method for Hard Combinatorial Optimization Problems.- The One-Commodity Pickup-and-Delivery Travelling Salesman Problem.- Reconstructing a Simple Polytope from Its Graph.- An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.- A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope.- Constructing New Facets of the Consecutive Ones Polytope.- A Simplex-Based Algorithm for 0-1 Mixed Integer Programming.- Mixed-Integer Value Functions in Stochastic Programming.- Exact Algorithms for NP-Hard Problems: A Survey.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 224 pp. Englisch. N° de réf. du vendeur 9783540005803
Quantité disponible : 1 disponible(s)
Vendeur : CSG Onlinebuch GMBH, Darmstadt, Allemagne
Softcover. Etat : Gut. Gebraucht - Gut Zustand: Gut, Mängelexemplar, X, 209 p. Also available online. About this book: 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. Written for researchers and professionals. N° de réf. du vendeur 14427
Quantité disponible : 2 disponible(s)
Vendeur : BennettBooksLtd, Los Angeles, CA, Etats-Unis
paperback. Etat : New. In shrink wrap. Looks like an interesting title! N° de réf. du vendeur Q-3540005803
Quantité disponible : 1 disponible(s)