Get Free Shipping on orders over $89
Lecture Notes in Computer Science : Optimal or Provably Near-Optimal Solutions - Michael Jünger
eTextbook alternate format product

Instant online reading.
Don't wait for delivery!

Lecture Notes in Computer Science

Optimal or Provably Near-Optimal Solutions

By: Michael Jünger (Editor), Denis Naddef (Editor)

Paperback | 21 November 2001

At a Glance

Paperback


$84.99

or 4 interest-free payments of $21.25 with

 or 

Ships in 5 to 7 business 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.

More in Databases

Microsoft Power BI For Dummies : For Dummies (Computer/Tech) - Jack A. Hyman
Python All-in-One For Dummies : 3rd Edition - John C. Shovic

RRP $74.95

$49.99

33%
OFF
Microsoft 365 Access For Dummies : Access for Dummies - Laurie A. Ulrich
Social Research Methods : 4th Edition - Maggie Walter

RRP $101.95

$87.75

14%
OFF
Data Analytics for Accounting ISE : 3rd Edition - Vernon J. Richardson

RRP $169.95

$146.75

14%
OFF
Data-driven BIM for Energy Efficient Building Design : 1st Edition - Saeed Banihashemi
Coding All-in-One For Dummies : 2nd Edition - Chris Minnick

RRP $69.95

$46.99

33%
OFF
SQL All-in-One For Dummies : For Dummies (Computer/Tech) - Allen G. Taylor