Network Flow Models for Robust Binary Optimization with Selective Adaptability

References

• Álvarez-Miranda E, Fernández E, Ljubić I (2015) The recoverable robust facility location problem. Transportation Res. Part B: Methodology 79:93–120.Crossref, Google Scholar
• Arslan AN, Detienne B (2022) Decomposition-based approaches for a class of two-stage robust binary optimization problems. INFORMS J. Comput. 34(2):857–871.Link, Google Scholar
• Bayram V, Baloch G, Gzara F, Elhedhli S (2022) Optimal order batching in warehouse management: A data-driven robust approach. INFORMS J. Optim. 4(3):278–303.Link, Google Scholar
• Bergman D, Bodur M, Cardonha C, Cire AA (2022) Network models for multiobjective discrete optimization. INFORMS J. Comput. 34(2):990–1005.Link, Google Scholar
• Bergman D, Cire AA, Hoeve W, Hooker JN (2014) Optimization bounds from binary decision diagrams. INFORMS J. Comput. 26(2):253–268.Link, Google Scholar
• Bergman D, Cire AA, Van Hoeve WJ, Hooker J (2016) Decision Diagrams for Optimization, vol. 1 (Springer, Cham, Switzerland).Crossref, Google Scholar
• Bertsimas D, Dunning I (2016) Multistage robust mixed-integer optimization with adaptive partitions. Oper. Res. 64(4):980–998.Link, Google Scholar
• Bertsimas D, Georghiou A (2015) Design of near optimal decision rules in multistage adaptive mixed-integer optimization. Oper. Res. 63(3):610–627.Link, Google Scholar
• Bertsimas D, Nasrabadi E, Stiller S (2013) Robust and adaptive network flows. Oper. Res. 61(5):1218–1242.Link, Google Scholar
• Bodur M, Chan TC, Zhu IY (2025) Network flow models for robust binary optimization with selective adaptability. INFORMS J. Comput. (INFORMS, Cantonsville, MD).Google Scholar
• Bryant RE (1992) Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surveys (CSUR) 24(3):293–318.Crossref, Google Scholar
• Buchheim C, Kurtz J (2018) Robust combinatorial optimization under convex and discrete cost uncertainty. EURO J. Comput. Optim. 6(3):211–238.Crossref, Google Scholar
• Castro MP, Cire AA, Beck JC (2022) Decision diagrams for discrete optimization: A survey of recent advances. INFORMS J. Comput. 34(4):2271–2295.Link, Google Scholar
• Cire AA, Van Hoeve WJ (2013) Multivalued decision diagrams for sequencing problems. Oper. Res. 61(6):1411–1428.Link, Google Scholar
• Davarnia D, Van Hoeve WJ (2021) Outer approximation for integer nonlinear programs via decision diagrams. Math. Programming 187:111–150.Crossref, Google Scholar
• Dumouchelle J, Julien E, Kurtz J, Khalil EB (2023) Neur2RO: Neural two-stage robust optimization. Twelfth Internat. Conf. Learn. Representations (OpenReview.net).Google Scholar
• Eufinger L, Kurtz J, Buchheim C, Clausen U (2020) A robust approach to the capacitated vehicle routing problem with uncertain costs. INFORMS J. Optim. 2(2):79–95.Link, Google Scholar
• Guo C, Bodur M, Aleman DM, Urbach DR (2021) Logic-based Benders decomposition and binary decision diagram based approaches for stochastic distributed operating room scheduling. INFORMS J. Comput. 33(4):1551–1569.Abstract, Google Scholar
• Hanasusanto GA, Kuhn D, Wiesemann W (2015) K-adaptability in two-stage robust binary programming. Oper. Res. 63(4):877–891.Link, Google Scholar
• Hooker JN (2013) Decision diagrams and dynamic programming. Internat. Conf. Integration Constraint Programming, Artificial Intelligence, and Oper. Res. (Springer, Cham, Switzerland), 94–110.Google Scholar
• Hooker JN (2022) Stochastic decision diagrams. Schaus P, ed. Internat. Conf. Integration Constraint Programming, Artificial Intelligence, and Oper. Res. (Springer, Cham, Switzerland), 138–154.Crossref, Google Scholar
• Kämmerling N, Kurtz J (2020) Oracle-based algorithms for binary two-stage robust optimization. Comput. Optim. Appl. 77(2):539–569.Crossref, Google Scholar
• Lozano L, Smith JC (2018) A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs. Math. Programming 191(1):381–404.Google Scholar
• Lozano L, Bergman D, Cire AA (2022) Constrained shortest-path reformulations for discrete bilevel and robust optimization. Preprint, submitted June 26, https://arxiv.org/abs/2206.12962v1.Google Scholar
• MacNeil M, Bodur M (2023) Leveraging decision diagrams to solve two-stage stochastic programs with binary recourse and logical linking constraints. Eur. J. Oper. Res. 315(1):228--241.Google Scholar
• McElfresh DC, Bidkhori H, Dickerson JP (2019) Scalable robust kidney exchange. Proc. AAAI Conf. Artificial Intelligence 33(1):1077–1084.Crossref, Google Scholar
• Neumann J (1928) Zur theorie der gesellschaftsspiele. Math. Ann. 100(1):295–320.Crossref, Google Scholar
• Postek K, Hertog D (2016) Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set. INFORMS J. Comput. 28(3):553–574.Link, Google Scholar
• Salemi H, Davarnia D (2023) On the structure of decision diagram–Representable mixed-integer programs with application to unit commitment. Oper. Res. 71(6):1943–1959.Link, Google Scholar
• Serra T, Hooker JN (2020) Compact representation of near-optimal integer programming solutions. Math. Programming 182(1):199–232.Crossref, Google Scholar
• Serra T, Raghunathan AU, Bergman D, Hooker J, Kobori S (2019) Last-mile scheduling under uncertainty. Internat. Conf. Integration Constraint Programming, Artificial Intelligence, and Oper. Res. (Springer, Cham, Switzerland), 519–528.Google Scholar
• Subramanyam A, Gounaris CE, Wiesemann W (2020) K-adaptability in two-stage mixed-integer robust optimization. Math. Programming Comput. 12(2):193–224.Crossref, Google Scholar
• Tjandraatmadja C, van Hoeve WJ (2019) Target cuts from relaxed decision diagrams. INFORMS J. Comput. 31(2):285–301.Link, Google Scholar
• van Hoeve WJ (2022) Graph coloring with decision diagrams. Math. Programming 192(1):631–674.Crossref, Google Scholar
• Vayanos P, Kuhn D, Rustem B (2011) Decision rules for information discovery in multi-stage stochastic programming. 2011 50th IEEE Conf. Decision Control Eur. Control Conf. (IEEE Computer Society, Washington, DC), 7368–7373.Crossref, Google Scholar
• Yan C, Kung J (2018) Robust aircraft routing. Transportation Sci. 52(1):118–133.Link, Google Scholar
• Yanıkoğlu İ, Gorissen BL, den Hertog D (2019) A survey of adjustable robust optimization. Eur. J. Oper. Res. 277(3):799–813.Crossref, Google Scholar
• Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5):457–461.Crossref, Google Scholar