Compact Extended Linear Programming Models

Giuseppe Lancia, Paolo Serafini (Autoren)

Buch | Hardcover

IX, 208 Seiten

2017 | 1st ed. 2018
Springer International Publishing (Verlag)
978-3-319-63975-8 (ISBN)

Artikel merken

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.

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.

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.

"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)

“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)

Erscheinungsdatum	22.10.2017
Reihe/Serie	EURO Advanced Tutorials on Operational Research
Zusatzinfo	IX, 208 p. 37 illus.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	497 g
Themenwelt	Wirtschaft ► Allgemeines / Lexika
Themenwelt	Wirtschaft ► Betriebswirtschaft / Management
Schlagworte	Bin Packing • Branch-and-cut • Business & Management • business and management • Business & Management • combinatorial optimization • compact extended formulations • cutting-stock • Data Mining • data mining and knowledge discovery • Expert systems / knowledge-based systems • ILP • knapsack • management & management techniques • Management Decision Making • Management & management techniques • Mathematical Modeling and Industrial Mathematics • Mathematical Modelling • Maths for engineers • max-cut • Operational Research • Operation Research/Decision Theory • Operations Research, Management Science • routing-cost • Steiner-tree
ISBN-10	3-319-63975-7 / 3319639757
ISBN-13	978-3-319-63975-8 / 9783319639758
Zustand	Neuware