Denis Naddef – författare & böcker

Computational Combinatorial Optimization

Optimal or Provably Near-Optimal Solutions

Häftad, Engelska, 2001

549 kr

Skickas inom 10-15 vardagar

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.

Computational Combinatorial Optimization

Optimal or Provably Near-Optimal Solutions

AvDenis Naddef,Michael Junger

E-bok

PDF, Engelska, 2001

712 kr

Läs direkt efter köp

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.

Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey - 50 Years of Integer Programming 1958-2008, Övrigt

50 Years of Integer Programming 1958-2008

From the Early Years to the State-of-the-Art

Springer-Verlag Berlin and Heidelberg GmbH & Co. KG

2009

1 800 kr

Skickas inom 10-15 vardagar

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.

Laurence A. Wolsey, Giovanni Rinaldi, Gerhard Reinelt, William R. Pulleyblank, George L. Nemhauser, Denis Naddef, Thomas M. Liebling, Michael Junger - 50 Years of Integer Programming 1958-2008, E-bok

50 Years of Integer Programming 1958-2008

From the Early Years to the State-of-the-Art

AvLaurence A. Wolsey,Giovanni Rinaldim. fl.

E-bok

PDF, Engelska, 2009

1 946 kr

Läs direkt efter köp

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.

50 Years of Integer Programming 1958-2008

From the Early Years to the State-of-the-Art

AvMichael Jünger,Thomas M. Lieblingm. fl.

Häftad, Engelska, 2017

1 524 kr

Skickas inom 10-15 vardagar

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.

Företag, bibliotek eller offentlig verksamhet?

Denis Naddef – författare

Computational Combinatorial Optimization

Computational Combinatorial Optimization

50 Years of Integer Programming 1958-2008

50 Years of Integer Programming 1958-2008

50 Years of Integer Programming 1958-2008

Mina sidor

Mina sidor

Hjälp

Hjälp

Om Bokus

Om Bokus

Populärt

Populärt

Inspiration

Inspiration