Author:
Pandey Pooja,Punnen Abraham P.
Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. Adams, W.P., Sherali, H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32, 1274–1290 (1986)
2. Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and sub-gradient optimization: a computational study. Math. Progr. 12, 37–60 (1980)
3. Bazaraa, M.S., Goode, J.J.: A cutting-plane algorithm for the quadratic set-covering problem. Oper. Res. 23, 150–158 (1975)
4. Beasley, J.E.: A lagrangian heuristic for set-covering problems. Naval Res. Logist. 37, 151–164 (1990)
5. Bector C.R., Bhatt S.K.: A linearization technique for solving integral linear fractional program: Proc. fifth Manitoba Conference on Numerical Mathematics, pp. 221–229 (1975)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献