The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
An Integer Programming Approach for Linear Programs with Probabilistic Constraints
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Network Formulations of Mixed-Integer Programs
Mathematics of Operations Research
Lot-Sizing with Stock Upper Bounds and Fixed Charges
SIAM Journal on Discrete Mathematics
On a class of mixed-integer sets with a single integer variable
Operations Research Letters
A note on the continuous mixing set
Operations Research Letters
Mixing Sets Linked by Bidirected Paths
SIAM Journal on Optimization
| Hi-index | 0.00 |
We analyze the polyhedral structure of the setsPCMIX = {( s, r, z) ?R XR+nXZ n|s +r j+z j=f j ,j = 1,..., n} andP+CMIX =PCMIXn{ s = 0}. The setP+CMIX is a natural generalization of the mixing set studied by Pochet and Wolsey [15, 16] and G脙录nl脙录k and Pochet [8] and recently has been introduced by Miller and Wolsey [12]. We introduce a new class of valid inequalities that has proven to be sufficient for describing conv( PCMIX). We give an extended formulation of sizeO( n) XO( n2) variables and constraints and indicate how to separate over conv( PCMIX) inO( n3) time. Finally, we show how the mixed integer rounding (MIR) inequalities of Nemhauser and Wolsey [14] and the mixing inequalities of G脙录nl脙录k and Pochet [8] constitute special cases of the cycle inequalities.