Combinatorial optimization addresses decision problems on discrete structures, such as routing, scheduling and network design, whose exact solution often lies beyond feasible computational limits.