The capacitated maximal covering location problem with backup service (Q920016): Difference between revisions

@@ Property / Wikidata QID @@
+Q58615149
@@ Property / Wikidata QID: Q58615149 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
+Normal rank
@@ Property / cites work @@
+Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Topological design of centralized computer networks—formulations and algorithms
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+A note on the knapsack problem with special ordered sets
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the capacitated concentrator location problem
+Normal rank
@@ Property / cites work @@
+An integer programming model for the allocation of databases in a distributed computer system
+Normal rank
@@ Property / cites work @@
+The Maximal Covering Location Problem with Capacities on Total Workload
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02097800
+Normal rank
@@ Property / OpenAlex ID @@
+W1997392494
@@ Property / OpenAlex ID: W1997392494 / rank @@
+Normal rank