Trending Bestseller

Compact Extended Linear Programming Models

No reviews yet Write a Review
Hardback
13 October 2017
$175.83
Ships in 3-5 business days

Delivery estimate

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

You Can Find This Title In

    Product Details
    ISBN-13
    9783319639758
    Author
    Giuseppe Lancia
    Publisher
    Springer Nature B.V.
    Published
    13 October 2017
    Format
    Hardback

    This product hasn't received any reviews yet. Be the first to review this product!

    $175.83
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Compact Extended Linear Programming Models

    $175.83

    Description

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

    You Can Find This Title In

      This Title Is Categorised As