Note: a local-search heuristic for large set-covering problems

被引:1
|
作者
Jacobs, L.W.
Brusco, M.J.
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [41] A Local Search-Based Approach for Set Covering
    Gupta, Anupam
    Lee, Euiwoong
    Li, Jason
    2023 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2023, : 1 - 11
  • [42] Evolutionary Search Techniques to Solve Set Covering Problems
    Gouwanda, Darwin
    Ponnambalam, S. G.
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 29, 2008, 29 : 20 - 25
  • [43] A multidimensional fitness function based heuristic algorithm for set covering problems
    Hashemi, Ahmad
    Gholami, Hamed
    Delorme, Xavier
    Wong, Kuan Yew
    APPLIED SOFT COMPUTING, 2025, 174
  • [44] A NOTE ON THE COMPLEXITY OF LOCAL SEARCH PROBLEMS
    FISCHER, ST
    INFORMATION PROCESSING LETTERS, 1995, 53 (02) : 69 - 75
  • [45] An iterated-tabu-search heuristic for a variant of the partial set covering problem
    Bilal, Nehme
    Galinier, Philippe
    Guibault, Francois
    JOURNAL OF HEURISTICS, 2014, 20 (02) : 143 - 164
  • [46] An iterated-tabu-search heuristic for a variant of the partial set covering problem
    Nehme Bilal
    Philippe Galinier
    Francois Guibault
    Journal of Heuristics, 2014, 20 : 143 - 164
  • [47] Note on the equivalence of the set covering and process network synthesis problems
    Imreh, B.
    Fulop, J.
    Friedler, F.
    Acta Cybern, 3 (497-502): : 497 - 502
  • [48] Solving large set covering problems for crew scheduling
    Ferdinando Pezzella
    Enrico Faggioli
    Top, 1997, 5 (1) : 41 - 59
  • [49] Towards a distributed local-search approach for partitioning large-scale social networks
    Zheng, Bin
    Liu, Ouyang
    Li, Jing
    Lin, Yong
    Chang, Chong
    Li, Bo
    Chen, Tefeng
    Peng, Hao
    INFORMATION SCIENCES, 2020, 508 : 200 - 213
  • [50] Analysis of a local search heuristic for facility location problems
    Korupolu, MR
    Plaxton, CG
    Rajaraman, R
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2000, 37 (01): : 146 - 188