Special-ordered sets (SOS)


2019 ◽  
Vol 44 (3) ◽  
pp. 793-820 ◽  
Author(s):  
Joey Huchette ◽  
Juan Pablo Vielma

A framework is presented for constructing strong mixed-integer programming formulations for logical disjunctive constraints. This approach is a generalization of the logarithmically sized formulations of Vielma and Nemhauser for special ordered sets of type 2 (SOS2) constraints, and a complete characterization of its expressive power is offered. The framework is applied to a variety of disjunctive constraints, producing novel small and strong formulations for outer approximations of multilinear terms, generalizations of special ordered sets, piecewise linear functions over a variety of domains, and obstacle avoidance constraints.



1976 ◽  
Vol 10 (1) ◽  
pp. 52-69 ◽  
Author(s):  
E. M. L. Beale ◽  
J. J. H. Forrest


2000 ◽  
Vol 89 (1) ◽  
pp. 187-203 ◽  
Author(s):  
I.R. de Farias, Jr. ◽  
E.L. Johnson ◽  
G.L. Nemhauser


2007 ◽  
Vol 180 (2) ◽  
pp. 754-769 ◽  
Author(s):  
G.D.H. Claassen ◽  
Th.H.B. Hendriks


1981 ◽  
Vol 1 (1) ◽  
pp. 18-22 ◽  
Author(s):  
Ellis L. Johnson ◽  
Manfred W. Padberg




Sign in / Sign up

Export Citation Format

Share Document