A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
From MaRDI portal
Publication:5108220
DOI10.1287/MOOR.2018.0946zbMath1434.90170arXiv1607.04803OpenAlexW2963059144WikidataQ127814714 ScholiaQ127814714MaRDI QIDQ5108220
Juan Pablo Vielma, Joey Huchette
Publication date: 30 April 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.04803
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (8)
Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ Mixed-Integer Convex Representability ⋮ Piecewise polyhedral formulations for a multilinear term ⋮ Modeling combinatorial disjunctive constraints via junction trees ⋮ Piecewise linear trees as surrogate models for system design and planning under high-frequency temporal variability ⋮ MIP relaxations in factorable programming ⋮ Facet separation for disjunctive constraints with network flow representation ⋮ Balas formulation for the union of polytopes is optimal
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Orbital branching
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
- Algorithm for cardinality-constrained quadratic optimization
- Nonconvex, lower semicontinuous piecewise linear optimization
- Bipartite dimensions and bipartite degrees of graphs
- Towards compatible triangulations.
- A polyhedral study of the cardinality constrained knapsack problem
- Models for representing piecewise linear cost functions
- Heuristics for cardinality constrained portfolio optimization
- Computational study of a family of mixed-integer quadratic programming problems
- Branching rules revisited
- A global optimization algorithm for linear fractional and bilinear programs
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- BARON: A general purpose global optimization software package
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Some results on the strength of relaxations of multilinear functions
- Enhancements on the hyperplanes arrangements in mixed-integer programming techniques
- Chromatic characterization of biclique covers
- Ideal representations of lexicographic orderings and base-2 expansions of integer variables
- Incremental and encoding formulations for mixed integer programming
- Mixed integer models for the stationary case of gas network optimization
- Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
- Mixed Integer Linear Programming Formulation Techniques
- Logic, Optimization, and Constraint Programming
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Integer Programming
- Modelling with integer variables
- An Automatic Method of Solving Discrete Programming Problems
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Mixed-Integer Representations in Control Design
- Principles of Constraint Programming
- 50 Years of Integer Programming 1958-2008
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Some Combinatorial Lemmas in Topology
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A bilinear approach to the pooling problem†
- A Survey of Combinatorial Gray Codes
- Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
This page was built for publication: A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
