Dual-Feasible Functions for Integer Programming and Combinatorial Optimization

Linear and Integer Programming.- Classical Dual-feasible Functions.- General Dual-feasible Functions.- Applications for Cutting and Packing Problems.- Other Applications in General Integer Programming.  

Cláudio Alves is Associate Professor of Operations Research at the Department of Production and Systems, School of Engineering, University of Minho, Portugal. He received his M.Sc., Ph.D. and Habilitation degrees in Industrial and Systems Engineering from the University of Minho. He has published more than 60 papers that appeared in international volumes and journals such as European Journal of Operational Research, Computers and Operations Research, INFORMS Journal on Computing, Operations Research Letters and Annals of Operations Research.His main scientific interests include the development and analysis of integer programming models and solution methods with an emphasis on decomposition-based approaches, combinatorial optimization, heuristics, metaheuristics and matheuristics, integrated optimization problems, applications of mixed integer programming to production and supply chain management, and the development of optimization software and decision support systems.François Clautiaux is Professor of Operations Research at the Mathematic Department of the University of Bordeaux, France. He received both his M.Sc. and Ph.D. degrees from the University of Technology of Compiègne, France. He has published in international journals including European Journal of Operational Research, Discrete Applied Mathematics, Discrete Optimization, INFORMS Journal on Computing, Computers and Operations Research, and Annals of Operations Research.His research interests are focused on methods based on integer programming, and their applications to several fields including cutting and packing, employee scheduling, vehicle routing, and clustering.José Valério de Carvalho graduated in engineering at the Faculdade de Engenharia da Universidade do Porto, and received his M.Sc. degree in Industrial Engineering and Operations Research from the Virginia Polytechnic Institute and State University, and his Ph.D. degree in Engineering Production and Operations Research from the University of

"In this book, DFFs are discussed within the general framework of duality. A whole machinery of theoretical results is developed. It is demonstrated that many results on integer optimization problems can actually be obtained in a unified manner from this machinery. ... I expect the book to be extremely helpful for readers who are interested in integer linear optimization and techniques for proving good lower bounds." (Hans-Ulrich Simon, Mathematical Reviews, January, 2017)

"The authors provide a textbook covering the topic of dual feasible functions (DFF), that were originally used to solve the problems involving the knapsack inequalities ... . the results are illustrated with examples. There are also exercises with solutions ending each chapter. The book will be for sure interesting and useful for the graduate students in operations research, mathematics, optimization and similar areas, as well as for their lecturers. Also, more advanced undergraduate students could make use of this textbook." (Marcin Anholcer, zbMATH 1354.90101, 2017)