A dissection of the duality gap of set covering problems

DOI10.1007/978-3-030-48439-2_21MaRDI QIDQ2050255zbMATH OpenOpenAlexFDO

Authors Uledi Ngulo, Torbjörn Larsson, Nils-Hassan Quttineh

Publication date 30 August 2021

Full work available at URL https://doi.org/10.1007/978-3-030-48439-2_21

zbMATH Keywords

discrete optimizationduality gapset covering problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Dissecting the duality gap: the supporting hyperplane interpretation revisited
• The set covering problem revisited: an empirical study of the value of dual information
• Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
• A note on duality gap in the simple plant location problem
• Maximally disjoint solutions of the set covering problem

Cited in

(8)

• A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
• A novel decomposition approach to set covering problems by exploiting special structures
• Dissecting the duality gap: the supporting hyperplane interpretation revisited
• A theoretical justification of the set covering greedy heuristic of Caprara et al.
• Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
• scientific article; zbMATH DE number 5990470 (Why is no real title available?)
• scientific article; zbMATH DE number 1354909 (Why is no real title available?)
• A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem

This page was built for publication: A dissection of the duality gap of set covering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2050255)