50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art - Softcover

Inhaltsangabe

I 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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.