Pages that link to "Item:Q4025918"

The following pages link to Backbone Network Design Tools with Economic Tradeoffs (Q4025918):

Displaying 26 items.

• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
• Topological design of computer communication networks -- the overall design problem (Q1194726) (← links)
• A system for priority routing and capacity assignment in packet switched networks (Q1197787) (← links)
• Topological design of wide area communication networks (Q1197802) (← links)
• Configuring wide area computer networks. Problems and models (Q1207261) (← links)
• Primary and secondary route selection in backbone communication networks (Q1268202) (← links)
• Capacity planning in manufacturing and computer networks (Q1278227) (← links)
• Routing and capacity assignment in backbone communication networks (Q1373886) (← links)
• Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
• A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
• New formulations and solution procedures for the hop constrained network design problem. (Q1810496) (← links)
• Routing and capacity assignment in backbone communication networks under time varying traffic conditions (Q1847143) (← links)
• Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
• Asynchronous transfer mode networks with parallel links and multiple service classes (Q1869520) (← links)
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (Q2052386) (← links)
• A branch and price approach for the robust bandwidth packing problem with queuing delays (Q2070728) (← links)
• Algorithms for an integer multicommodity network flow problem with node reliability considerations (Q2247900) (← links)
• Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
• A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs. (Q2468608) (← links)
• Resource allocation and capacity assignment in distributed systems (Q2564753) (← links)
• An efficient heuristic to dimension large-scale hybrid optoelectronic networks (Q2581615) (← links)
• Separable convexification and DCA techniques for capacity and flow assignment problems (Q2773173) (← links)
• Exact approaches to the single-source network loading problem (Q2892148) (← links)
• The network redesign problem for access telecommunications networks (Q4266755) (← links)
• Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs (Q5449668) (← links)