A survey on combinatorial optimization

This survey revisits classical combinatorial optimization algorithms and extends them to two-stage stochastic models, particularly focusing on client-element problems. We reformulate these problems to optimize element selection under uncertainty and present two key sampling algorithms: SSA andBoost-and-Sample, highlighting their performance guarantees. Additionally, we explore correlation-robust optimization, introducing the concept of the correlation gap, which enables approximations using independent distributions with minimal accuracy loss. This survey analyzes and presents foundational combinatorial optimization methods for researchers at the intersection of this field and reinforcement learning.