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

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

ISBN-10:
3662501813
ISBN-13:
9783662501818
Pub. Date:
02/09/2011
Publisher:
Springer Berlin Heidelberg
ISBN-10:
3662501813
ISBN-13:
9783662501818
Pub. Date:
02/09/2011
Publisher:
Springer Berlin Heidelberg
50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art

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

Paperback

$139.99
Current price is , Original price is $139.99. You
$139.99 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Overview

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a paper that described a cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In 2008, to commemorate the anniversary of this seminal paper, a special workshop celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop.

It contains reprints of key historical articles and written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community. Useful for anyone in mathematics, computer science and operations research, this book exposes mathematical optimization, specifically integer programming and combinatorial optimization, to a broad audience.


Product Details

ISBN-13: 9783662501818
Publisher: Springer Berlin Heidelberg
Publication date: 02/09/2011
Edition description: Softcover reprint of the original 1st ed. 2010
Pages: 804
Product dimensions: 6.10(w) x 9.25(h) x (d)

Table of Contents

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.- TheGroup-Theoretic Approach in Mixed Integer Programming.
From the B&N Reads Blog

Customer Reviews