Carnegie Mellon University
Browse

Polyhedral Approaches to Mixed Integer Linear Programming

Download (335.71 kB)
journal contribution
posted on 2006-01-01, 00:00 authored by Michele Conforti, Gerard CornuejolsGerard Cornuejols, Giacomo Zambelli
This survey presents tools from polyhedral theory that are used in integer programming. It applies them to the study of valid inequalities for mixed integer linear sets, such as Gomory's mixed integer cuts.

History

Publisher Statement

All Rights Reserved

Date

2006-01-01

Usage metrics

    Categories

    Keywords

    mixed integer linear programFarkas' lemmaMinkowski-Weyl theorempolyhedronunion of polyhedracutting planesplit cutGomory mixed integer cutChvátal rankBusiness and Management not elsewhere classified

    Licence

    In Copyright

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC