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

ISBN-10: 3540682740

ISBN-13: 9783540682745

In 1958, Ralph E. Gomory reworked the sphere of integer programming whilst he released a paper that defined a cutting-plane set of rules for natural integer courses and introduced that the strategy should be sophisticated to provide a finite set of rules for integer programming. In 2008, to commemorate the anniversary of this seminal paper, a distinct workshop celebrating fifty years of integer programming was once held in Aussois, France, as a part of the twelfth Combinatorial Optimization Workshop. It comprises reprints of key old articles and written models of survey lectures on six of the most well liked subject matters within the box via unusual individuals of the integer programming group. necessary for an individual in arithmetic, desktop technological know-how and operations learn, this booklet exposes mathematical optimization, in particular integer programming and combinatorial optimization, to a large viewers.

Show description

Read Online or Download 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art PDF

Best mathematics books

Several complex variables and integral formulas - download pdf or read online

This quantity is an introductory textual content in numerous advanced variables, utilizing tools of imperative representations and Hilbert area concept. It investigates in general the stories of the estimate of suggestions of the Cauchy Riemann equations in pseudoconvex domain names and the extension of holomorphic services in submanifolds of pseudoconvex domain names which have been constructed within the final 50 years.

Get EGA IV 4: Etude locale des schemas et des morphismes de PDF

Eight. five x eleven hardcover - in EGA sequence - textual content in French

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

Sample text

The lowest dimensional faces of the polyhedron are 1-dimensional or higher. This was hard to write and hard to read. (c) At this point, Alan benefitted greatly from simplifications suggested by David Gale and anonymous referees, but it was still not so simple. (d) Independently, we both wondered: If the vertices were integral for every integral right hand side, did this mean the matrix was totally unimodular? This is discussed in our paper, and also in References [1] and [2], especially the latter.

North Holland, Amsterdam, 1991, pp. 77–81. 2. A. Schrijver, Combinatorial optimization: polyhedra and efficiency, Vol. A. Paths, Flows, Matchings, Springer, Berlin, 2003. 2 The Hungarian Method for the Assignment Problem 31 32 Harold W. W. Kuhn, The Hungarian Method for the Assignment Problem, Naval Research Logistics Quarterly 2 (1955) 83–97. 2 The Hungarian Method for the Assignment Problem 33 34 Harold W. Kuhn 2 The Hungarian Method for the Assignment Problem 35 36 Harold W. Kuhn 2 The Hungarian Method for the Assignment Problem 37 38 Harold W.

I then realized that Egerv´ary’s paper gave a computationally trivial method for reducing the general assignment problem to a 0-1 problem. Thus, by putting the two ideas together, the Hungarian Method was born. I tested the algorithm by solving 12 by 12 problems with random 3-digit ratings by hand. I could do any such problem, with pencil and paper, in no more than 2 hours. This seemed to be much better than any other method known at the time. The paper was published in Naval Research Logistics Quarterly.

Download PDF sample

50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art by Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey


by Ronald
4.4

Rated 4.70 of 5 – based on 40 votes