Set Covering and Involutory Bases

DOI10.1287/mnsc.18.3.194zbMath0228.90048OpenAlexW2066982044MaRDI QIDQ5636706

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

Programming involving graphs or networks (90C35)

Related Items (5)

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

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