A polyhedral study on chance constrained program with random right-hand side
The essential structure of the mixed-integer programming formulation for chance-
constrained program (CCP) is the intersection of multiple mixing sets with a 0–1 knapsack …
constrained program (CCP) is the intersection of multiple mixing sets with a 0–1 knapsack …
[HTML][HTML] Mixed n-step MIR inequalities: Facets for the n-mixing set
S Sanjeevi, K Kianfar - Discrete Optimization, 2012 - Elsevier
Günlük and Pochet [O. Günlük, Y. Pochet, Mixing mixed integer inequalities. Mathematical
Programming 90 (2001) 429–457] proposed a procedure to mix mixed integer rounding …
Programming 90 (2001) 429–457] proposed a procedure to mix mixed integer rounding …
[图书][B] Mixed n-step MIR inequalities, n-step conic MIR inequalities and a polyhedral study of single row facility layout problem
S Sanjeevi - 2012 - search.proquest.com
MIXED n-STEP MIR INEQUALITIES, n-STEP CONIC MIR INEQUALITIES AND A
POLYHEDRAL STUDY OF SINGLE ROW FACILITY LAYOUT PROBLEM A Diss Page 1 …
POLYHEDRAL STUDY OF SINGLE ROW FACILITY LAYOUT PROBLEM A Diss Page 1 …
[PDF][PDF] Strong Inequalities for Chance–Constrained Programming
M Zhao, K Huang, B Zeng - 2015 - optimization-online.org
As an essential substructure underlying a large class of chance-constrained programming
problems with finite discrete distributions, the mixing set with 0− 1 knapsack has received …
problems with finite discrete distributions, the mixing set with 0− 1 knapsack has received …