Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference21 articles.
1. A dynamic subgradient-based branch-and-bound procedure for set covering;Balas;Oper. Res.,1996
2. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study;Balas,1980
3. An algorithm for set covering problem;Beasley;Eur. J. Oper. Res.,1987
4. A Lagrangian heuristic for set-covering problems;Beasley;Nav. Res. Logist.,1990
5. OR-library: distributing test problems by electronic mail;Beasley;J. Oper. Res. Soc.,1990
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献