A theoretical justification of the set covering greedy heuristic of Caprara et al.

Beasley, 1987, An algorithm for set covering problem, European J. Oper. Res., 31, 85, 10.1016/0377-2217(87)90141-X Beasley, 1990, A Lagrangian heuristic for set-covering problems, Nav. Res. Logist., 37, 151, 10.1002/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2 Grossman, 1997, Computational experience with approximation algorithms for the set covering problem, European J. Oper. Res., 101, 81, 10.1016/S0377-2217(96)00161-0 Haddadi, 1997, Simple Lagrangian heuristic for the set covering problem, European J. Oper. Res., 97, 200, 10.1016/S0377-2217(96)00050-1 Ceria, 1998, A Lagrangian-based heuristic for large-scale set covering problems, Math. Program., 81, 215, 10.1007/BF01581106 Caprara, 1999, A heuristic method for the set covering problem, Oper. Res., 47, 730, 10.1287/opre.47.5.730 Hiriart-Urruty, 1993 Bazaraa, 1993 Bertsekas, 1999 Bertsekas, 2003 Larsson, 2006, Global optimality conditions for discrete and nonconvex optimization—With applications to Lagrangian heuristics and column generation, Oper. Res., 54, 436, 10.1287/opre.1060.0292 Shapiro, 1979 Quttineh, 2022, Dissecting the duality gap—The supporting hyperplane interpretation revisited, Optim. Lett., 16, 1093, 10.1007/s11590-021-01764-7 Zhao, 2020, An integer programming column generation principle for heuristic search methods, Int. Trans. Oper. Res., 27, 665, 10.1111/itor.12521 Ngulo, 2020, A dissection of the duality gap of set covering problems, 175 Wolsey, 1998 Beasley, 1990, OR-Library: distributing test problems by electronic mail, J. Oper. Res. Soc., 41, 1069, 10.1057/jors.1990.166