Branch-and-Price
- Publisher's listprice EUR 53.49
-
22 184 Ft (21 128 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 12% (cc. 2 662 Ft off)
- Discounted price 19 522 Ft (18 593 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
22 184 Ft
Availability
Not yet published.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Springer Nature Switzerland
- Date of Publication 18 December 2025
- Number of Volumes 1 pieces, Book
- ISBN 9783031969164
- Binding Hardback
- No. of pages670 pages
- Size 235x155 mm
- Language English
- Illustrations X, 670 p. 216 illus., 181 illus. in color. Illustrations, color 700
Categories
Long description:
"
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.
" MoreTable of Contents:
"
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.
" More
