Using a facility location algorithm to solve large set covering problems (Q796457): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(84)90047-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2051373514
@@ Property / OpenAlex ID: W2051373514 / rank @@
+Normal rank
@@ Property / cites work @@
+Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
+Normal rank
@@ Property / cites work @@
+A Dual-Based Procedure for Uncapacitated Facility Location
+Normal rank
@@ Property / cites work @@
+Worst case analysis of a class of set covering heuristics
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Solutions to Minimum-Cover Problems
@@ Property / cites work: Computer Solutions to Minimum-Cover Problems / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient heuristic for large set covering problems
+Normal rank