Custom cover image
Custom cover image

Branch-and-Price / by Jacques Desrosiers, Marco Lübbecke, Guy Desaulniers, Jean Bertrand Gauthier

By: Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Publisher: Cham : Springer Nature Switzerland, 2026Publisher: Cham : Imprint: Springer, 2026Edition: 1st ed. 2026Description: 1 Online-Ressource(XV, 663 p. 216 illus., 181 illus. in color.)ISBN:
  • 9783031969171
Subject(s): Additional physical formats: 9783031969164 | 9783031969188 | 9783031969195 | Erscheint auch als: 9783031969164 Druck-Ausgabe | Erscheint auch als: 9783031969188 Druck-Ausgabe | Erscheint auch als: 9783031969195 Druck-AusgabeDDC classification:
  • 658.403 23
DOI: DOI: 10.1007/978-3-031-96917-1Online resources: Summary: Linear and Integer Linear Programming -- Column Generation -- Dantzig-Wolfe Decomposition for Linear Programming -- Dantzig-Wolfe Decomposition for Integer Linear Programming -- Vehicle Routing and Crew Scheduling Problems -- Dual Point of View -- Branch-Price-and-Cut -- Conclusion.Summary: 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 mixed-integer 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 branch-and-price, reformulation techniques like Dantzig-Wolfe 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 near-optimal solutions through decomposition methods and column generation.PPN: PPN: 1960499211Package identifier: Produktsigel: ZDB-2-SEB | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SOB
No physical items for this record

Open Access

Barrierefreier Inhalt: Table of contents navigation. Single logical reading order. Short alternative textual descriptions. Use of color is not sole means of conveying information. Use of high contrast between text and background color. Next / Previous structural navigation. All non-decorative content supports reading without sight

Anmerkungen zur Barrierefreiheit: This PDF does not fully comply with PDF/UA standards, but does feature limited screen reader support, described non-text content (images, graphs), bookmarks for easy navigation and searchable, selectable text. Users of assistive technologies may experience difficulty navigating or interpreting content in this document. We recognize the importance of accessibility, and we welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us at accessibilitysupport@springernature.com.. No reading system accessibility options actively disabled. Publisher contact for further accessibility information: accessibilitysupport@springernature.com

KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT