| 000 | 05593nam a22005535i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-68279-0 | ||
| 003 | DE-He213 | ||
| 005 | 20140220084519.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2010 gw | s |||| 0|eng d | ||
| 020 |
_a9783540682790 _9978-3-540-68279-0 |
||
| 024 | 7 |
_a10.1007/978-3-540-68279-0 _2doi |
|
| 050 | 4 | _aQA164-167.2 | |
| 072 | 7 |
_aPBV _2bicssc |
|
| 072 | 7 |
_aMAT036000 _2bisacsh |
|
| 082 | 0 | 4 |
_a511.6 _223 |
| 100 | 1 |
_aJünger, Michael. _eeditor. |
|
| 245 | 1 | 0 |
_a50 Years of Integer Programming 1958-2008 _h[electronic resource] : _bFrom the Early Years to the State-of-the-Art / _cedited by Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey. |
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
| 300 |
_aXX, 804 p. 151 illus., 52 illus. in color. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 505 | 0 | _aI The Early Years -- Solution of a Large-Scale Traveling-Salesman Problem -- The Hungarian Method for the Assignment Problem -- Integral Boundary Points of Convex Polyhedra -- Outline of an Algorithm for Integer Solutions to Linear Programs An Algorithm for the Mixed Integer Problem -- An Automatic Method for Solving Discrete Programming Problems -- Integer Programming: Methods, Uses, Computation -- Matroid Partition -- Reducibility Among Combinatorial Problems -- Lagrangian Relaxation for Integer Programming -- Disjunctive Programming -- II From the Beginnings to the State-of-the-Art -- Polyhedral Approaches to Mixed Integer Linear Programming -- Fifty-Plus Years of Combinatorial Integer Programming -- Reformulation and Decomposition of Integer Programs -- III Current Topics -- Integer Programming and Algorithmic Geometry of Numbers -- Nonlinear Integer Programming -- Mixed Integer Programming Computation -- Symmetry in Integer Linear Programming -- Semidefinite Relaxations for Integer Programming -- The Group-Theoretic Approach in Mixed Integer Programming. | |
| 520 | _aIn 1958, Ralph E. Gomory transformed the field of integer programming when he published a short paper that described his cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In January of 2008, to commemorate the anniversary of Gomory's seminal paper, a special session celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. This book is based on the material presented during this session. 50 Years of Integer Programming offers an account of featured talks at the 2008 Aussois workshop, namely - Michele Conforti, Gérard Cornuéjols, and Giacomo Zambelli: Polyhedral Approaches to Mixed Integer Linear Programming - William Cook: 50+ Years of Combinatorial Integer Programming - Francois Vanderbeck and Laurence A. Wolsey: Reformulation and Decomposition of Integer Programs The book contains reprints of key historical articles together with new introductions and historical perspectives by the authors: Egon Balas, Michel Balinski, Jack Edmonds, Ralph E. Gomory, Arthur M. Geoffrion, Alan J. Hoffman & Joseph B. Kruskal, Richard M. Karp, Harold W. Kuhn, and Ailsa H. Land & Alison G. Doig. It also contains written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community: - Friedrich Eisenbrand: Integer Programming and Algorithmic Geometry of Numbers - Raymond Hemmecke, Matthias Köppe, Jon Lee, and Robert Weismantel: Nonlinear Integer Programming - Andrea Lodi: Mixed Integer Programming Computation - Francois Margot: Symmetry in Integer Linear Programming - Franz Rendl: Semidefinite Relaxations for Integer Programming - Jean-Philippe P. Richard and Santanu S. Dey: The Group-Theoretic Approach to Mixed Integer Programming Integer programming holds great promise for the future, and continues to build on its foundations. Indeed, Gomory's finite cutting-plane method for the pure integer case is currently being reexamined and is showing new promise as a practical computational method. This book is a uniquely useful celebration of the past, present and future of this important and active field. Ideal for students and researchers in mathematics, computer science and operations research, it exposes mathematical optimization, in particular integer programming and combinatorial optimization, to a broad audience. | ||
| 650 | 0 | _aMathematics. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 0 | _aCombinatorics. | |
| 650 | 0 | _aMathematical optimization. | |
| 650 | 1 | 4 | _aMathematics. |
| 650 | 2 | 4 | _aCombinatorics. |
| 650 | 2 | 4 | _aOptimization. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aOperations Research/Decision Theory. |
| 700 | 1 |
_aLiebling, Thomas M. _eeditor. |
|
| 700 | 1 |
_aNaddef, Denis. _eeditor. |
|
| 700 | 1 |
_aNemhauser, George L. _eeditor. |
|
| 700 | 1 |
_aPulleyblank, William R. _eeditor. |
|
| 700 | 1 |
_aReinelt, Gerhard. _eeditor. |
|
| 700 | 1 |
_aRinaldi, Giovanni. _eeditor. |
|
| 700 | 1 |
_aWolsey, Laurence A. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540682745 |
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-540-68279-0 |
| 912 | _aZDB-2-SMA | ||
| 999 |
_c111181 _d111181 |
||