Set Covering and Involutory Bases

DOI10.1287/MNSC.18.3.194zbMATH Open0241.90036OpenAlexW2066982044MaRDI QIDQ5652446FDOQ5652446

H. Donald Ratliff, Mandell Bellmore

Publication date: 1971

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.18.3.194

Mathematics Subject Classification ID

Integer programming (90C10)

Cited In (11)

• A set covering reformulation of the pure fixed charge transportation problem
• Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives
• On solving multi objective Set Covering Problem with imprecise linear fractional objectives
• Some problems in discrete optimization
• Implicit enumeration algorithms for the set-partitioning problem
• Algorithms for large scale set covering problems
• Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming
• Relation between set partitioning and set covering problems with quadratic fractional objective functions
• The dynamic set covering problem
• Enhancing an algorithm for set covering problems
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables

This page was built for publication: Set Covering and Involutory Bases

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