50 Years of Integer Programming 1958-2008

Edited by Michael Jünger (), Thomas M. Liebling (), Denis Naddef (), George L. Nemhauser (), William R. Pulleyblank (), Gerhard Reinelt (), Giovanni Rinaldi () and Laurence A. Wolsey ()

in Springer Books from Springer

Date: 2010
ISBN: 978-3-540-68279-0
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Chapters in this book:

Ch Chapter 1 Solution of a Large-Scale Traveling-Salesman Problem

Vašek Chvátal, William Cook, George B. Dantzig, Delbert R. Fulkerson and Selmer M. Johnson

Ch Chapter 10 Disjunctive Programming

Egon Balas

Ch Chapter 11 Polyhedral Approaches to Mixed Integer Linear Programming

Michele Conforti, Gérard Cornuéjols and Giacomo Zambelli

Ch Chapter 12 Fifty-Plus Years of Combinatorial Integer Programming

William Cook

Ch Chapter 13 Reformulation and Decomposition of Integer Programs

François Vanderbeck and Laurence A. Wolsey

Ch Chapter 14 Integer Programming and Algorithmic Geometry of Numbers

Friedrich Eisenbrand

Ch Chapter 15 Nonlinear Integer Programming

Raymond Hemmecke, Matthias Köppe, Jon Lee and Robert Weismantel

Ch Chapter 16 Mixed Integer Programming Computation

Andrea Lodi

Ch Chapter 17 Symmetry in Integer Linear Programming

François Margot

Ch Chapter 18 Semidefinite Relaxations for Integer Programming

Franz Rendl

Ch Chapter 19 The Group-Theoretic Approach in Mixed Integer Programming

Jean-Philippe P. Richard and Santanu S. Dey

Ch Chapter 2 The Hungarian Method for the Assignment Problem

Harold W. Kuhn

Ch Chapter 3 Integral Boundary Points of Convex Polyhedra

Alan J. Hoffman and Joseph B. Kruskal

Ch Chapter 4 Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem

Ralph E. Gomory

Ch Chapter 5 An Automatic Method for Solving Discrete Programming Problems

Ailsa H. Land and Alison G. Doig

Ch Chapter 6 Integer Programming: Methods, Uses, Computation

Michel Balinski

Ch Chapter 7 Matroid Partition

Jack Edmonds

Ch Chapter 8 Reducibility Among Combinatorial Problems

Richard M. Karp

Ch Chapter 9 Lagrangian Relaxation for Integer Programming

Arthur M. Geoffrion

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprbok:978-3-540-68279-0

Ordering information: This item can be ordered from
http://www.springer.com/9783540682790

DOI: 10.1007/978-3-540-68279-0

Access Statistics for this book

More books in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().