Overview
- Authors:
-
-
Giuseppe Lancia
-
Department of Mathematics, Computer Science, and Physics, University of Udine, Udine, Italy
-
Paolo Serafini
-
Department of Mathematics, Computer Science, and Physics, University of Udine, Udine, Italy
- Presents, perhaps for the first time, the theory of compact extended ILP models in the most general and didactic form possible
- Provides a compact yet comprehensive introduction into exponential-size integer linear programming models
- Includes a wealth of examples from various application areas
- Some chapters are self-contained and can be used as short tutorials to the corresponding topics
- Includes supplementary material: sn.pub/extras
Access this book
Other ways to access
Table of contents (15 chapters)
-
-
- Giuseppe Lancia, Paolo Serafini
Pages 1-6
-
- Giuseppe Lancia, Paolo Serafini
Pages 7-31
-
- Giuseppe Lancia, Paolo Serafini
Pages 33-41
-
- Giuseppe Lancia, Paolo Serafini
Pages 43-66
-
- Giuseppe Lancia, Paolo Serafini
Pages 67-74
-
- Giuseppe Lancia, Paolo Serafini
Pages 75-102
-
- Giuseppe Lancia, Paolo Serafini
Pages 103-112
-
- Giuseppe Lancia, Paolo Serafini
Pages 113-121
-
- Giuseppe Lancia, Paolo Serafini
Pages 123-135
-
- Giuseppe Lancia, Paolo Serafini
Pages 137-147
-
- Giuseppe Lancia, Paolo Serafini
Pages 149-154
-
- Giuseppe Lancia, Paolo Serafini
Pages 155-164
-
- Giuseppe Lancia, Paolo Serafini
Pages 165-171
-
- Giuseppe Lancia, Paolo Serafini
Pages 173-181
-
- Giuseppe Lancia, Paolo Serafini
Pages 183-195
-
Back Matter
Pages 197-208
About this book
This book provides a handy, unified introduction to the theory of compact extended formulations of exponential-size integer linear programming (ILP) models. Compact extended formulations are equally powerful, but polynomial-sized, models whose solutions do not require the implementation of separation and pricing procedures. The book is written in a general, didactic form, first developing the background theoretical concepts (polyhedra, projections, linear and integer programming) and then delving into the various techniques for compact extended reformulations. The techniques are illustrated through a wealth of examples touching on many application areas, such as classical combinatorial optimization, network design, timetabling, scheduling, routing, computational biology and bioinformatics. The book is intended for graduate or PhD students – either as an advanced course on selected topics or within a more general course on ILP and mathematical programming – as well as for practitionersand software engineers in industry exploring techniques for developing optimization models for their specific problems.
Reviews
“This book is dedicated to presenting and applying the methods of compact extended formulations of linear optimization problems and polyhedra. … The main merit of this book is that it presents in a unified way the state of the art in the matter in discussion. … I consider the book to be a useful contribution to the literature on applications of (combinatorial) linear optimization problems … .” (Sorin-Mihai Grad, zbMATH 1390.90004, 2018)
About the authors
Giuseppe Lancia is Professor of Operations Research in the Department of Mathematics and Computer Science at the University of Udine, Italy.Paolo Serafini is Professor of Operations Research in the Department of Mathematics and Computer Science at the University of Udine, Italy.