0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R1,000 - R2,500 (1)
  • R2,500 - R5,000 (1)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art (Paperback, Softcover reprint of the... 50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art (Paperback, Softcover reprint of the original 1st ed. 2010)
Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, …
R3,747 Discovery Miles 37 470 Ships in 10 - 15 working days

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.

Computational Combinatorial Optimization - Optimal or Provably Near-Optimal Solutions (Paperback, 2001 ed.): Michael Junger,... Computational Combinatorial Optimization - Optimal or Provably Near-Optimal Solutions (Paperback, 2001 ed.)
Michael Junger, Denis Naddef
R1,576 Discovery Miles 15 760 Ships in 10 - 15 working days

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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Squishmallows Sticker Pack (5 Pieces)
R25 R23 Discovery Miles 230
ZA Choker Necklace
R570 R399 Discovery Miles 3 990
Canon 445XL Original High Yield Ink…
R940 R400 Discovery Miles 4 000
Bostik Glue Stick (40g)
R52 Discovery Miles 520
Ab Wheel
R209 R149 Discovery Miles 1 490
Witness To Power - A Political Memoir
Mathews Phosa Paperback R300 R215 Discovery Miles 2 150
Loot
Nadine Gordimer Paperback  (2)
R383 R318 Discovery Miles 3 180
Loot
Nadine Gordimer Paperback  (2)
R383 R318 Discovery Miles 3 180
Loot
Nadine Gordimer Paperback  (2)
R383 R318 Discovery Miles 3 180
Poor Things
Emma Stone, Mark Ruffalo, … DVD R343 Discovery Miles 3 430

 

Partners