Cutting Planes for Branch-and-Price Algorithms

Guy Desaulniers, Jacques Desrosiers, Simon Spoorendonk

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    This article presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be derived using the variables of an equivalent compact formulation (i.e., the subproblem variables) or the master problem variables. In the first case, cuts are added to the compact formulation, either at the master level or the subproblem level, and the decomposition process is reapplied. In the second case, we show that it is possible to model inequalities defined on the master problem variables by adding new variables and constraints to the subproblem formulation. The augmented subproblem indirectly indicates that there exists an augmented compact formulation that includes these new variables and constraints. Three examples on how to apply this framework are presented: the vehicle routing problem with time windows, the edge coloring problem, and the cutting stock problem. © 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 58(4), 301–310 2011
    Original languageEnglish
    JournalNetworks
    Volume58
    Issue number4
    Pages (from-to)301-310
    ISSN0028-3045
    DOIs
    Publication statusPublished - Nov 2011

    Keywords

    • column generation
    • integer programming
    • cutting planes
    • Dantzig-Wolfe decomposition

    Cite this

    Desaulniers, G., Desrosiers, J., & Spoorendonk, S. (2011). Cutting Planes for Branch-and-Price Algorithms. Networks, 58(4), 301-310. https://doi.org/10.1002/net.20471