A Lagrangean heuristic for the maximal covering location problem (Q1266569): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(94)00159-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2004389393
@@ Property / OpenAlex ID: W2004389393 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Large-scale Travelling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Note—Single and Double Vertex Substitution in Heuristic Procedures for the <i>p</i>-Median Problem
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+Computer Solutions of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+The capacitated maximal covering location problem with backup service
+Normal rank
@@ Property / cites work @@
+Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
+Normal rank