[AM00]
O. Abel and W. Marquardt, “Scenario-integrated modeling and
optimization of dynamic systems”, AIChE Journal, 46(4). 2000.
[Bal85]
E. Balas. “Disjunctive Programming and a Hierarchy of
Relaxations for Discrete Optimization Problems”, SIAM Journal on
Algebraic Discrete Methods, 6(3), 466–486, 1985. DOI
10.1137/0606047
[BJ72]
E. Balas and R. Jeroslow. “Canonical Cuts on the Unit Hypercube”,
SIAM Journal on Applied Mathematics 23(1), 61-19, 1972.
DOI 10.1137/0123007
[FGK02]
R. Fourer, D. M. Gay, and B. W. Kernighan. AMPL: A Modeling
Language for Mathematical Programming, 2nd Edition, Duxbury
Press, 2002.
[GLM99]
A. Grothey, S. Leyffer, and K. I. M. McKinnon. “A note
on feasibility in Benders Decomposition”, Numerical Analysis Report
NA/188, Dundee University. 1999.
[GT13]
I. E. Grossmann and F. Trespalacios. “Systematic modeling
of discrete-continuous optimization models through generalized
disjunctive programming”, AIChE Journal, 59(9),
3276–3295. 2013. DOI 10.1002/aic.14088
[IAE+21]
N. M. Isenberg, P. Akula, J. C. Eslick, D. Bhattacharyya,
D. C. Miller, and C. E. Gounaris. “A generalized cutting‐set approach
for nonlinear robust optimization in process systems engineering”,
AIChE Journal, 67:e17175. 2021. DOI 10.1002/aic.17175
[KMM+23]
B. Knueven, D. Mildebrath, C. Muir, J. D. Siirola,
J.-P. Watson, and D. L. Woodruff. “A Parallel Hub-and-Spoke System
for Large-Scale Scenario-Based Optimization Under Uncertainty”, Math
Programming Computation, 15, 591-619. 2023. DOI
10.1007/s12532-023-00247-3
[KMT21]
J. Kronqvist, R. Misener, and C. Tsay. “Between Steps:
Intermediate Relaxations between big-M and Convex Hull
Reformulations”. 2021. https://arxiv.org/abs/2101.12708
[NW88]
G. L. Nemhauser and L. A. Wolsey. Integer and combinatorial
optimization, New York: Wiley. 1988.
[RB01]
W. C. Rooney and L. T. Biegler. “Design for model parameter
uncertainty using nonlinear confidence regions”, AIChE Journal,
47(8). 2001.
[RG94]
R. Raman and I. E. Grossmann. “Modelling and computational
techniques for logic based integer programming”, Computers and
Chemical Engineering, 18(7), 563–578. 1994. DOI
10.1016/0098-1354(93)E0010-7
[SG03]
N. W. Sawaya and I. E. Grossmann. “A cutting plane
method for solving linear generalized disjunctive programming
problems”, Computer Aided Chemical Engineering, 15(C),
1032–1037. 2003. DOI 10.1016/S1570-7946(03)80444-3
[TG15]
F. Trespalacios and I. E. Grossmann. “Improved Big-M
reformulation for generalized disjunctive programs”, Computers and
Chemical Engineering, 76, 98–103. 2015. DOI
10.1016/j.compchemeng.2015.02.013
[VAN10]
J. P. Vielma, S. Ahmed, and G. Nemhauser. “Mixed-Integer
Models for Non-separable Piecewise Linear Optimization: Unifying
framework and Extensions”, Operations Research 58(2), 303-315. 2010.