A multiperiod planning model for the capacitated minimal spanning tree problem (Q1969870): Difference between revisions

@@ Property / cites work @@
+Heuristics with Constant Error Guarantees for the Design of Tree Networks
+Normal rank
@@ Property / cites work @@
+The Capacitated Minimum Spanning Tree
@@ Property / cites work: The Capacitated Minimum Spanning Tree / rank @@
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Optimal design of centralized computer networks
@@ Property / cites work: Optimal design of centralized computer networks / rank @@
+Normal rank
@@ Property / cites work @@
+Topological design of centralized computer networks—formulations and algorithms
+Normal rank
@@ Property / cites work @@
+Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
+Normal rank
@@ Property / cites work @@
+A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Centralized teleprocessing network design
@@ Property / cites work: Centralized teleprocessing network design / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the capacitated tree problem
@@ Property / cites work: The complexity of the capacitated tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the capacitated concentrator location problem
+Normal rank