A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints

  title={A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints},
  author={Joey Huchette and Juan Pablo Vielma},
  journal={Math. Oper. Res.},
  • Joey Huchette, Juan Pablo Vielma
  • Published 2019
  • Computer Science, Mathematics
  • Math. Oper. Res.
  • We present a framework for constructing strong mixed-integer programming formulations for logical disjunctive constraints. Our approach is a generalization of the logarithmically-sized formulations of Vielma and Nemhauser for SOS2 constraints, and we offer a complete characterization of its expressive power. We apply the framework to a variety of disjunctive constraints, producing novel small and strong formulations for outer approximations of multilinear terms, generalizations of special… CONTINUE READING
    9 Citations
    A mixed-integer branching approach for very small formulations of disjunctive constraints
    • 1
    • PDF
    A geometric way to build strong mixed-integer programming formulations
    • PDF
    Piecewise Polyhedral Formulations for a Multilinear Term
    • 2
    • PDF
    Nonconvex piecewise linear functions: Advanced formulations and simple modeling tools
    • 12
    • PDF
    Compact Disjunctive Approximations to Nonconvex Quadratically Constrained Programs
    • 1
    • PDF
    Mixed-Integer Convex Representability
    • 12
    • PDF
    Balas formulation for the union of polytopes is optimal
    • PDF


    Disjunctive programming and a hierarchy of relaxations for discrete optimization problems
    • 398
    • PDF
    Embedding Formulations and Complexity for Unions of Polyhedra
    • 15
    • PDF
    Incremental and encoding formulations for Mixed Integer Programming
    • 22
    • PDF
    Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
    • 156
    Modelling with Integer Variables.
    • 126
    • Highly Influential
    Explicit-Constraint Branching for Solving Mixed-Integer Programs
    • 27
    • PDF
    A polyhedral study of the cardinality constrained knapsack problem
    • 46
    • PDF
    Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
    • 57
    • PDF
    Ideal representations of lexicographic orderings and base-2 expansions of integer variables
    • 17
    Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
    • 240
    • PDF