Picture 1 of 1

Primal Heuristics in Integer Programming by Domenico Salvagnin, Andrea Lodi and Timo Berthold (2025, Trade Paperback)

Great Book Prices Store (339838)

96.8% positive Feedback

Price:

US $49.24

Approximately£36.45

+ $19.99 postage

Estimated delivery Mon, 4 Aug - Wed, 20 Aug

Returns:

14 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.

Condition:

New

About this product

Product Identifiers

PublisherCambridge University Press

ISBN-101009574809

ISBN-139781009574808

eBay Product ID (ePID)17072298850

Product Key Features

LanguageEnglish

Publication NamePrimal Heuristics in Integer Programming

Publication Year2025

SubjectGeneral

TypeTextbook

AuthorDomenico Salvagnin, Andrea Lodi, Timo Berthold

Subject AreaMathematics

FormatTrade Paperback

Dimensions

Item Height0.3 in

Item Length9 in

Item Width6 in

Additional Product Features

Reviews'Primal Heuristics in Integer Programming by Timo Berthold, Andrea Lodi, and Domenico Salvagnin is a groundbreaking work that offers deep insights and practical approaches to design sound heuristics for integer programming. This book will be an invaluable resource for both researchers and practitioners in the field. I will highly recommend the book to anyone looking to deepen their understanding of this crucial area.' Matteo Fischetti, University of Padua, Italy

IllustratedYes

Table Of Content1. Introduction and concepts; 2. Large neighborhood search; 3. Rounding, propagation and diving; 4. The feasibility pump family; 5. Pivoting and line search heuristics; 6. Computational study; 7. Primal heuristics for mixed integer nonlinear programming; 8. Machine learning for primal heuristics; Appendix. Quiz solutions; References; Index.

SynopsisPrimal heuristics guarantee that feasible, high-quality solutions are provided at an early stage of the solving process, and thus are essential to the success of mixed-integer programming (MIP). By helping prove optimality faster, they allow MIP technology to extend to a wide variety of applications in discrete optimization. This first comprehensive guide to the development and use of primal heuristics within MIP technology and solvers is ideal for computational mathematics graduate students and industry practitioners. Through a unified viewpoint, it gives a unique perspective on how state-of-the-art results are integrated within the branch-and-bound approach at the core of the MIP technology. It accomplishes this by highlighting all the required knowledge needed to push the heuristic side of MIP solvers to their limit and pointing out what is left to do to improve them, thus presenting heuristic approaches for MIP as part of the MIP solving process., Primal heuristics have allowed mixed-integer programming to extend to many practical applications by guaranteeing that feasible solutions of high quality are available at an early stage of the solving process. This first comprehensive book on its use and development is ideal for graduate students and industry practitioners.