This open access book is a unique resource in computational mathematical optimization. It conveys the entire spectrum from the basic theory to the most advanced tricks in reformulations and decomposition approaches to solving mixedinteger linear programs. The book has useful and partly previously unpublished facts for students, teachers, and practitioners alike. The content covers algorithmic ideas like column generation, cutting planes, and branchandprice, reformulation techniques like DantzigWolfe decomposition and Lagrangian relaxation, the very important application domains of vehicle routing and crew scheduling, and has some practical advice when it comes to an implementation. Many notes and even more didactic illustrations and examples bring the theory to life, complemented by almost 140 exercises, including solutions. As a side effect, readers learn ways how to formulate integer programming models for a great variety of combinatorial optimization problems. The material draws from more than 400 references and the four authors' own decades of experience in the field. Several photos taken by the authors bring a personal touch to the writing, among other tiny anecdotal elements that the connoisseur will appreciate. The book is not, and cannot be encyclopedic, but it has the ambition to be the standard text and main reference in the field for the years to come. Students, researchers, and practitioners aiming to solve large, complex discrete and combinatorial optimization problems—whether in industry, science, or technology—will find this book essential for exploring optimal and nearoptimal solutions through decomposition methods and column generation.
This open access book is a unique resource in computational mathematical optimization. It conveys the entire spectrum from the basic theory to the most advanced tricks in reformulations and decomposition approaches to solving mixedinteger linear programs. The book has useful and partly previously unpublished facts for students, teachers, and practitioners alike. The content covers algorithmic ideas like column generation, cutting planes, and branchandprice, reformulation techniques like DantzigWolfe decomposition and Lagrangian relaxation, the very important application domains of vehicle routing and crew scheduling, and has some practical advice when it comes to an implementation. Many notes and even more didactic illustrations and examples bring the theory to life, complemented by almost 140 exercises, including solutions. As a side effect, readers learn ways how to formulate integer programming models for a great variety of combinatorial optimization problems. The material draws from more than 400 references and the four authors' own decades of experience in the field. Several photos taken by the authors bring a personal touch to the writing, among other tiny anecdotal elements that the connoisseur will appreciate. The book is not, and cannot be encyclopedic, but it has the ambition to be the standard text and main reference in the field for the years to come. Students, researchers, and practitioners aiming to solve large, complex discrete and combinatorial optimization problems—whether in industry, science, or technology—will find this book essential for exploring optimal and nearoptimal solutions through decomposition methods and column generation.
Barnes & Noble is the world’s largest retail bookseller and a leading retailer of content, digital media and educational products. Our Nook Digital business offers a lineup of NOOK® tablets and e-Readers and an expansive collection of digital reading content through the NOOK Store®. Barnes & Noble’s mission is to operate the best omni-channel specialty retail business in America, helping both our customers and booksellers reach their aspirations, while being a credit to the communities we serve.
