Path relinking approach for multiple allocation hub maximal covering problem (Q971739): Difference between revisions

@@ Property / cites work @@
+Hub Location and the <i>p</i>-Hub Median Problem
@@ Property / cites work: Hub Location and the <i>p</i>-Hub Median Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for the Hub Location Problem
@@ Property / cites work: Lower Bounds for the Hub Location Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Integer programming formulations of discrete hub location problems
+Normal rank
@@ Property / cites work @@
+The Latest Arrival Hub Location Problem
@@ Property / cites work: The Latest Arrival Hub Location Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The single-assignment hub covering problem: Models and linearizations
+Normal rank
@@ Property / cites work @@
+Principles of scatter search
@@ Property / cites work: Principles of scatter search / rank @@
+Normal rank
@@ Property / cites work @@
+Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
+Normal rank
@@ Property / cites work @@
+Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
+Normal rank