Advertisement

Compact Extended Linear Programming Models

  • Giuseppe Lancia
  • Paolo Serafini

Part of the EURO Advanced Tutorials on Operational Research book series (EUROATOR)

Table of contents

  1. Front Matter
    Pages i-ix
  2. Giuseppe Lancia, Paolo Serafini
    Pages 1-6
  3. Giuseppe Lancia, Paolo Serafini
    Pages 7-31
  4. Giuseppe Lancia, Paolo Serafini
    Pages 33-41
  5. Giuseppe Lancia, Paolo Serafini
    Pages 43-66
  6. Giuseppe Lancia, Paolo Serafini
    Pages 67-74
  7. Giuseppe Lancia, Paolo Serafini
    Pages 75-102
  8. Giuseppe Lancia, Paolo Serafini
    Pages 103-112
  9. Giuseppe Lancia, Paolo Serafini
    Pages 113-121
  10. Giuseppe Lancia, Paolo Serafini
    Pages 123-135
  11. Giuseppe Lancia, Paolo Serafini
    Pages 137-147
  12. Giuseppe Lancia, Paolo Serafini
    Pages 149-154
  13. Giuseppe Lancia, Paolo Serafini
    Pages 155-164
  14. Giuseppe Lancia, Paolo Serafini
    Pages 165-171
  15. Giuseppe Lancia, Paolo Serafini
    Pages 173-181
  16. Giuseppe Lancia, Paolo Serafini
    Pages 183-195
  17. Back Matter
    Pages 197-208

About this book

Introduction

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.

Keywords

ILP combinatorial optimization branch-and-cut compact extended formulations max-cut bin packing cutting-stock knapsack Steiner-tree routing-cost

Authors and affiliations

  • Giuseppe Lancia
    • 1
  • Paolo Serafini
    • 2
  1. 1.Department of Mathematics, Computer Science, and PhysicsUniversity of UdineUdineItaly
  2. 2.Department of Mathematics, Computer Science, and PhysicsUniversity of UdineUdineItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-63976-5
  • Copyright Information Springer International Publishing AG 2018
  • Publisher Name Springer, Cham
  • eBook Packages Business and Management
  • Print ISBN 978-3-319-63975-8
  • Online ISBN 978-3-319-63976-5
  • Series Print ISSN 2364-687X
  • Series Online ISSN 2364-6888
  • Buy this book on publisher's site
Industry Sectors
Pharma
Materials & Steel
Automotive
Biotechnology
Finance, Business & Banking
Consumer Packaged Goods
Energy, Utilities & Environment
Oil, Gas & Geosciences
Engineering