Disjunctive Programming

By Hanif D. Sherali. Encyclopedia of Optimization, 2009

427 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (2008, background): “Using results from disjunctive programming [3,4,6,9,20,41] they showed that, in this case, constraint (1) can be simply modeled as”
Algorithms and Software for Convex Mixed Integer Nonlinear Programs (2012, background): “In the case of MILP, clever intuition of Balas and Perregaard [12] have eliminated the need to solve such a problem to generate cuts.”
Bounding and Counting Linear Regions of Deep Neural Networks (2017, background): “More generally, we can represent linear regions as a disjunctive program (Balas, 1979), which consist of a union of polyhedra.”
On handling indicator constraints in mixed integer programming (2016, background): “, [2,11,19]) to deal with indicator constraints and disjunctions in general.”
A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (2015, methodology): “Disjunctive methods in mixed integer linear optimization have been studied extensively during the past decades [4, 5, 13, 17].”
Mixed Integer Linear Programming Formulation Techniques (2015, background): “Sets of this form usually appear as the feasible regions of certain disjunctive programming problems [10, 11, 13].”