Q4266755 (Q4266755): Difference between revisions

@@ Property / cites work @@
+Models for planning capacity expansion in local access telecommunication networks
+Normal rank
@@ Property / cites work @@
+A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
+Normal rank
@@ Property / cites work @@
+Q3786250
@@ Property / cites work: Q3786250 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem
+Normal rank
@@ Property / cites work @@
+Topological design of telecommunication networks --- local access design methods
+Normal rank
@@ Property / cites work @@
+Backbone Network Design Tools with Economic Tradeoffs
+Normal rank
@@ Property / cites work @@
+A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
+Normal rank
@@ Property / cites work @@
+Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities
+Normal rank
@@ Property / cites work @@
+Operations Research and Capacity Expansion Problems: A Survey
+Normal rank
@@ Property / cites work @@
+Modeling and Solving the Two-Facility Capacitated Network Loading Problem
+Normal rank
@@ Property / cites work @@
+Networks synthesis and optimum network design problems: Models, solution methods and applications
+Normal rank
@@ Property / cites work @@
+The One-Terminal TELPAK Problem
@@ Property / cites work: The One-Terminal TELPAK Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cost routing for static network models
@@ Property / cites work: Minimum cost routing for static network models / rank @@
+Normal rank