Large-scale local search heuristics for the capacitated vertexp-center problem (Q4474299): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20000
@@ Property / full work available at URL: https://doi.org/10.1002/net.20000 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1999488323
@@ Property / OpenAlex ID: W1999488323 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+How to Allocate Network Centers
@@ Property / cites work: How to Allocate Network Centers / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangean heuristic for the maximal covering location problem
+Normal rank
@@ Property / cites work @@
+Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+The Capacitated <i>K</i>-Center Problem
@@ Property / cites work: The Capacitated <i>K</i>-Center Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A column generation approach to capacitated \(p\)-median problems
+Normal rank
@@ Property / cites work @@
+A class of greedy algorithms for the generalized assignment problem
+Normal rank

Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem (Q4474299): Difference between revisions