Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions -
-30% with code BOOKS
Shipping in 12-18 days
30-day return policy
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 man ... Full description
You May Also Like
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-30% with code BOOKS
In stock at our supplier
TOP
The 21st Century Brain: Cutting edge neuroscience to help us navigate the future
-30% with code BOOKS
In stock at our supplier
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-30% with code BOOKS
In stock at our supplier
TOP
AI Engineering: Building Applications with Foundation Models
-30% with code BOOKS
In stock at our supplier
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-30% with code BOOKS
In stock at our supplier
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-30% with code BOOKS
In stock at our supplier
TOP
How To Think About AI: A Guide For The Perplexed
-30% with code BOOKS
In stock at our supplier
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-30% with code BOOKS
In stock at our supplier
TOP
How to Talk to AI: (And How Not To)
-30% with code BOOKS
In stock at our supplier
TOP
Why Machines Learn: The Elegant Math Behind Modern AI
-30% with code BOOKS
In stock at our supplier
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-30% with code BOOKS
In stock at our supplier
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-30% with code BOOKS
In stock at our supplier
TOP
The Art of Game Design: A Book of Lenses
-30% with code BOOKS
In stock at our supplier
TOP
How Linux Works: What Every Superuser Should Know
-30% with code BOOKS
In stock at our supplier
TOP
Hands-On Large Language Models: Language Understanding and Generation
Maarten Grootendorst, Jay Alammar
-30% with code BOOKS
In stock at our supplier
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-30% with code BOOKS
In stock at our supplier
TOP
Slanted 47 Digital Tools: Slanted Magazine
-30% with code BOOKS
In stock at our supplier
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-30% with code BOOKS
In stock at our supplier
TOP
Deep Learning: Foundations and Concepts
Christopher M. Bishop, Hugh Bishop
-30% with code BOOKS
In stock at our supplier
Description
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 Information
| Publisher | Springer Berlin Heidelberg |
|---|---|
| Series | Lecture Notes in Computer Science |
| Release year | 2001 |
| Cover type | Softcover |
| EAN | 9783540428770 |