首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Two new heuristics for the location set covering problem
Authors:M Almiñana  J T Pastor
Institution:(1) Dept. of Stat. and Oper. Res., University of Alicante, Spain
Abstract:Summary In this paper we present two new greedy-type heuristics for solving the location set covering problem. We compare our new pair of algorithms with the pair GH1 and GH2 Vasko and Wilson (1986)] and show that they perform better for a selected set of test problems.
Keywords:Location set covering problem  heuristics
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号