Compact Extended Linear Programming Models

• Κύριοι συγγραφείς: Lancia, Giuseppe (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut), Serafini, Paolo (http://id.loc.gov/vocabulary/relators/aut)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2018.
• Έκδοση: 1st ed. 2018.
• Σειρά: EURO Advanced Tutorials on Operational Research,
• Θέματα: Operations research.; Decision making.; Management science.; Mathematical models.; Data mining.; Operations Research/Decision Theory.; Operations Research, Management Science.; Mathematical Modeling and Industrial Mathematics.; Data Mining and Knowledge Discovery.

 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 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 practitioners and software engineers in industry exploring techniques for developing optimization models for their specific problems. 

 Introduction -- Polyhedra -- Linear Programming -- Integer Linear Programming -- Large-scale Linear Programming -- General Techniques for Compact Formulations -- The Permutahedron -- The Parity Polytope -- Trees -- Cuts and Induced Bipartite Subgraphs -- Stable Sets -- Traveling Salesman Problems -- Packing -- Scheduling -- Computational Biology Problems.