Set Covering and Involutory Bases

DOI10.1287/MNSC.18.3.194zbMath0241.90036OpenAlexW2066982044MaRDI QIDQ5652446

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)

Related Items (11)

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

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