: Finding high-quality solutions quickly in massive datasets.
So open the book (in whatever format you legally obtain), start with the knapsack problem, and work your way to facets of the traveling salesman polytope. That is the path Bertsimas and Weismantel lay out—and it remains one of the most rewarding treks in operations research.
Since many seek the to skim specific sections, here’s a breakdown of the key chapters and their takeaways.
For the student, it offers the theoretical tools to understand why some problems are easy (network flows, total unimodularity) and others are impossibly hard (general IPs). For the practitioner, it provides the mental framework to model real-world problems effectively and choose between branch-and-cut, Lagrangian relaxation, or heuristics. And for the researcher, it remains a standard reference, a testament to the idea that even in a non-convex, discrete world, structure and elegance can be found.
: Finding high-quality solutions quickly in massive datasets.
So open the book (in whatever format you legally obtain), start with the knapsack problem, and work your way to facets of the traveling salesman polytope. That is the path Bertsimas and Weismantel lay out—and it remains one of the most rewarding treks in operations research.
Since many seek the to skim specific sections, here’s a breakdown of the key chapters and their takeaways.
For the student, it offers the theoretical tools to understand why some problems are easy (network flows, total unimodularity) and others are impossibly hard (general IPs). For the practitioner, it provides the mental framework to model real-world problems effectively and choose between branch-and-cut, Lagrangian relaxation, or heuristics. And for the researcher, it remains a standard reference, a testament to the idea that even in a non-convex, discrete world, structure and elegance can be found.
