Set Covering and Involutory Bases

DOI10.1287/MNSC.18.3.194MaRDI QIDQ5636706zbMATH OpenOpenAlexFDO

Authors Mandell Bellmore, H. Donald Ratliff

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

Programming involving graphs or networks (90C35)

Cited in

(5)

• Enhancing an algorithm for set covering problems
• A binary cat swarm optimization algorithm for the non-unicost set covering problem
• A goal programming approach to solve linear fractional multi-objective set covering problem.
• Some problems in discrete optimization
• Minimal disconnecting sets in directed multi‐commodity networks

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 Q5636706)