Michael Jünger (ed.); Thomas M. Liebling (ed.); Denis Naddef (ed.); George L. Nemhauser (ed.); William R. Pulleyblank (ed.) Springer (2009) Saatavuus: Tilaustuote Moniviestin
Michael Jünger; Gerhard Reinelt; Giovanni Rinaldi Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2003) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Michael Jünger; Thomas M. Liebling; Denis Naddef; George L. Nemhauser; William R. Pulleyblank; Gerhard Reinelt; G Rinaldi Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2017) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Aimee Bender; Marc Parent; Michael Connelly; Benjamin Cheever; Sebastian Junger; Elizabeth McCracken; Rosie O'Donnell; Of Tantor Media, Inc (2005) Saatavuus: Hankintapalvelu CD-äänilevy
J. Michael Plavcan; Richard F. Kay; William L. Jungers; Carel P. van Schaik Springer Science+Business Media (2001) Saatavuus: Tilaustuote Kovakantinen kirja
J. Michael Plavcan (ed.); Richard F. Kay (ed.); William L. Jungers (ed.); Carel P. van Schaik (ed.) Springer (2012) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Achim Bachem; Ulrich Derigs; Michael Jünger; Rainer Schrader Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (1994) Saatavuus: Tilaustuote Pehmeäkantinen kirja
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.
