Neighborhood search heuristics for the uncapacitated facility location problem (Q1400664): Difference between revisions

@@ Property / cites work @@
+Methods of finding all minimum coverings of a graph by cliques
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3351135
@@ Property / cites work: Q3351135 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dual-Based Procedure for Uncapacitated Facility Location
+Normal rank
@@ Property / cites work @@
+A competitive local search heuristic for the subset sum problem
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+On the exact solution of large-scale simple plant location problems
+Normal rank
@@ Property / cites work @@
+Q3993417
@@ Property / cites work: Q3993417 / rank @@
+Normal rank
@@ Property / cites work @@
+The Assortment Problem with Nonlinear Cost Functions
+Normal rank
@@ Property / cites work @@
+The Discrete Two-Dimensional Assortment Problem
@@ Property / cites work: The Discrete Two-Dimensional Assortment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Plant Location Problem: New Models and Research Prospects
+Normal rank
@@ Property / cites work @@
+An efficient tabu search procedure for the \(p\)-median problem
+Normal rank
@@ Property / cites work @@
+A two-phase tabu search approach to the location routing problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(02)00504-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2081029938
@@ Property / OpenAlex ID: W2081029938 / rank @@
+Normal rank