This directory contains the code for the K-adaptability branch-and-bound (K-B&B) algorithm, with random node selection and ML-informed node selection (i.e., K-B&B-NodeSelection). K-adaptability is a solution approach for two-stage robust optimization problems.
No takes yet. Share an insight, caveat, or question.
Julien et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: