Primal Heuristics in Integer Programming

List of contents

1. 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.

About the author

Timo Berthold is Lecturer at TU Berlin and a Director at FICO, leading the MIP research and development team of the FICO Xpress Solver. He is an expert on heuristic methods and computational mixed-integer linear and nonlinear programming. He has won multiple awards for his research.Andrea Lodi is Andrew H. and Ann R. Tisch Professor at the Jacobs Technion-Cornell Institute at Cornell Tech and the Technion - ITT. His main research interests are in mixed-integer linear and nonlinear programming and data science. He has been recognized by IBM and Google faculty awards, and the INFORMS Optimization Society 2021 Farkas Prize. He is a 2023 INFORMS Fellow.Domenico Salvagnin is Associate Professor in Operations Research at the University of Padua, Italy. He was lead development scientist in the IBM CPLEX team in 2015–2017 and is currently scientific consultant for FICO Xpress. His research interests include computational integer programming, constraint programming and hybrid methods for optimization.

Product details

• Authors: Timo Berthold, Timo (Fico) Lodi Berthold, Andrea Lodi, Lodi Andrea, Domenico Salvagnin
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Hardback
• Released: 30.04.2025
• EAN: 9781009574785
• ISBN: 978-1-0-0957478-5
• No. of pages: 139
• Subjects: Natural sciences, medicine, IT, technology > Mathematics > General, dictionaries; Optimization, MATHEMATICS / General, Discrete Mathematics, Mathematical theory of computation, For graduate / post-graduate and equivalents