The use of state space relaxation for the dynamic facility location problem (Q920008): Difference between revisions

@@ Property / cites work @@
+The dynamic set covering problem
@@ Property / cites work: The dynamic set covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+State-space relaxation procedures for the computation of bounds to routing problems
+Normal rank
@@ Property / cites work @@
+A comparative study of approaches to dynamic location problems
+Normal rank
@@ Property / cites work @@
+The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic
+Normal rank
@@ Property / cites work @@
+Dynamic versions of set covering type public facility location problems
+Normal rank
@@ Property / cites work @@
+Q4145178
@@ Property / cites work: Q4145178 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Traveling Salesman Problem
@@ Property / cites work: An Algorithm for the Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Operations Research and Capacity Expansion Problems: A Survey
+Normal rank
@@ Property / cites work @@
+Multilocation Plant Sizing and Timing
@@ Property / cites work: Multilocation Plant Sizing and Timing / rank @@
+Normal rank
@@ Property / cites work @@
+A Dual-Based Procedure for Dynamic Facility Location
+Normal rank
@@ Property / cites work @@
+The Multiperiod Location-Allocation Problem with Relocation of Facilities
+Normal rank