Cover Image
Read Now

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

Bibliographic Details
Other Authors: Jünger, Michael (Editor), Reinelt, Gerhard (Editor), Rinaldi, Giovanni (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2003, 2003
Edition:1st ed. 2003
Series:Lecture Notes in Computer Science
Subjects:
Computer Graphics
Computer Science / Mathematics
Numerical Analysis
Discrete Mathematics In Computer Science
Algorithms
Probability Theory
Discrete Mathematics
Probabilities
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 02463nmm a2200385 u 4500
001 EB001884549
003 EBX01000000000000001047916
005 00000000000000.0
007 cr|||||||||||||||||||||
008 191115 ||| eng
020 |a 9783540364788 
100 1 |a Jünger, Michael  |e [editor] 
245 0 0 |a Combinatorial Optimization -- Eureka, You Shrink!  |h Elektronische Ressource  |b Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers  |c edited by Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi 
250 |a 1st ed. 2003 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2003, 2003 
300 |a X, 214 p  |b online resource 
505 0 |a “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 
653 |a Computer graphics 
653 |a Computer science / Mathematics 
653 |a Numerical Analysis 
653 |a Discrete Mathematics in Computer Science 
653 |a Computer Graphics 
653 |a Algorithms 
653 |a Probability Theory 
653 |a Numerical analysis 
653 |a Discrete mathematics 
653 |a Probabilities 
700 1 |a Reinelt, Gerhard  |e [editor] 
700 1 |a Rinaldi, Giovanni  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/3-540-36478-1 
856 4 0 |u https://doi.org/10.1007/3-540-36478-1?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 519.2 

Similar Items