Demonstrates improved efficiency in solving complex two-stage robust mixed-integer programs, indicating significant advancements in optimization techniques.
• Column-and-constraint generation for two-stage robust mixed-integer programs. • Faster solution using dual bounds, adaptive time limits, and gap propagation. • Most effective when second-stage problems are computationally hard. • Tested on a robust location routing and a robust berth allocation problem.
No takes yet. Share an insight, caveat, or question.
Goerigk et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: