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

被引：1

|

作者：

Jacobs, L.W.

Brusco, M.J.

机构：

来源：

Naval Research Logistics | 1995年 / 42卷 / 07期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[31] Geometric dominating-set and set-cover via local-search
De, Minati
Lahiri, Abhiruk
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2023, 113
[32] A large neighbourhood search heuristic for covering designs
Nikolic, Nebojsa
Grujicic, Igor
Mladenovic, Nenad
IMA JOURNAL OF MANAGEMENT MATHEMATICS, 2016, 27 (01) : 89 - 106
[33] An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
Chinneck, JW
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1996, 17 (1-2) : 127 - 144
[34] USING SURROGATE CONSTRAINTS IN A LAGRANGIAN-RELAXATION APPROACH TO SET-COVERING PROBLEMS
JOHN, CG
KOCHENBERGER, GA
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (07) : 681 - 685
[35] Local-Search based Approximation Algorithms for Mobile Facility Location Problems
Ahmadian, Sara
Friggstad, Zachary
Swamy, Chaitanya
PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1607 - 1621
[36] An incremental approach using local-search heuristic for inventory routing problem in industrial gases
Singh, Tejinder
Arbogast, Jeffrey E.
Neagu, Nicoleta
COMPUTERS & CHEMICAL ENGINEERING, 2015, 80 : 199 - 210
[37] A NOTE ON SOME COMPUTATIONALLY DIFFICULT SET COVERING PROBLEMS
AVIS, D
MATHEMATICAL PROGRAMMING, 1980, 18 (02) : 138 - 145
[38] Generating SAT local-search heuristics using a GP hyper-heuristic framework
Bader-El-Den, Mohamed
Poli, Riccardo
ARTIFICIAL EVOLUTION, 2008, 4926 : 37 - 49
[39] Note on connection between PNS and set covering problems
Blazsik, Z.
Imreh, B.
Acta Cybernetica, 12 (03):
[40] Local search algorithm for unicost set covering problem
Musliu, Nysret
ADVANCES IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4031 : 302 - 311

← 1 2 3 4 5 →