Pages that link to "Item:Q1179728"

The following pages link to Topological design of telecommunication networks --- local access design methods (Q1179728):

Displaying 37 items.

• A two-level location-allocation problem in designing local access fiber optic networks (Q337111) (← links)
• A new approach for solving the network problems (Q505104) (← links)
• A splitter location-allocation problem in designing fiber optic access networks (Q531477) (← links)
• Tree network design avoiding congestion (Q646180) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• Routing of uncertain traffic demands (Q833385) (← links)
• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
• An equitable bandwidth allocation model for video-on-demand networks (Q1035732) (← links)
• A constrained Steiner tree problem (Q1129916) (← links)
• Topological design of computer communication networks -- the overall design problem (Q1194726) (← links)
• Solving to optimality the uncapacitated fixed-charge network flow problem (Q1265864) (← links)
• Location of hubs in a competitive environment (Q1296365) (← links)
• Algorithms for a multi-level network optimization problem (Q1307817) (← links)
• Some thoughts on combinatorial optimisation (Q1388818) (← links)
• Designing tributary networks with multiple ring families. (Q1406732) (← links)
• A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
• A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem (Q1791944) (← links)
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. (Q1811625) (← links)
• Cost-optimal topology planning of hierarchical access networks (Q1886727) (← links)
• The \((K, k)\)-capacitated spanning tree problem (Q1926491) (← links)
• Bounding quality of pure Nash equilibria in dual-role facility location games (Q2091109) (← links)
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem (Q2147081) (← links)
• GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (Q2271122) (← links)
• A global optimization algorithm for reliable network design (Q2379515) (← links)
• Two new algorithms for UMTS access network topology design (Q2387233) (← links)
• RAMP for the capacitated minimum spanning tree problem (Q2430627) (← links)
• Lower and upper bounds for a two-level hierarchical location problem in computer networks (Q2462545) (← links)
• Tree knapsack approaches for local access network design (Q2503262) (← links)
• Towards optimizing the deployment of optical access networks (Q2513732) (← links)
• Savings based ant colony optimization for the capacitated minimum spanning tree problem (Q2581619) (← links)
• Cost-effective designs of fault-tolerant access networks in communication systems (Q3057095) (← links)
• Equitable bandwidth allocation in content distribution networks (Q3553745) (← links)
• The network redesign problem for access telecommunications networks (Q4266755) (← links)
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
• Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
• Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)