Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
Published Online:1 Oct 2021https://doi.org/10.1287/ijoc.2021.1061
- Cited by
- 28 February 2026 | Mathematical Programming Computation, Vol. 18, No. 2
- 20 April 2026 | INFORMS Journal on Computing, Vol. 0, No. 0
- 29 January 2026 | Mathematical Programming, Vol. 34
- European Journal of Operational Research, Vol. 327, No. 3
- IEEE Transactions on Smart Grid, Vol. 16, No. 6
- European Journal of Operational Research, Vol. 324, No. 3
- IEEE Transactions on Reliability, Vol. 74, No. 2
- 2 January 2025 | European Journal of Breast Health, Vol. 21, No. 1
- IEEE Transactions on Engineering Management, Vol. 72
- 22 February 2024 | Journal of Global Optimization, Vol. 89, No. 3
- European Journal of Operational Research, Vol. 315, No. 1
- 21 August 2023 | INFORMS Journal on Computing, Vol. 36, No. 1
- European Journal of Operational Research, Vol. 312, No. 1
- 5 September 2024 | Open Journal of Mathematical Optimization, Vol. 5
- 7 February 2023 | Journal of Scheduling, Vol. 26, No. 2
- 29 March 2022 | Optimization and Engineering, Vol. 23, No. 4
- 9 March 2022 | INFORMS Journal on Computing, Vol. 34, No. 4
Volume 34, Issue 2
March-April 2022
Pages 671-1304, C2
Article Information
Supplemental Material
Metrics
Information
- Received:July 21, 2019
- Accepted:November 25, 2020
- Published Online:October 01, 2021
Copyright © 2021, INFORMS
Cite as
Ayşe N. Arslan, Boris Detienne (2021) Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems. INFORMS Journal on Computing 34(2):857-871.
https://doi.org/10.1287/ijoc.2021.1061
Keywords
