Pages that link to "Item:Q4319533"

The following pages link to Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem (Q4319533):

Displaying 28 items.

• Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
• Lagrangian decompositions for the two-level FTTx network design problem (Q743641) (← links)
• Network flow models for the local access network expansion problem (Q856692) (← links)
• Optimal design of hierarchical networks with free main path extremes (Q943800) (← links)
• Multicommodity flow models for spanning trees with hop constraints (Q1278374) (← links)
• The design of service systems with queueing time cost, workload capacities and backup service (Q1291646) (← links)
• Designing reliable tree networks with two cable technologies (Q1291775) (← links)
• Algorithms for a multi-level network optimization problem (Q1307817) (← links)
• Solution procedures for the service system design problem (Q1361393) (← links)
• A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
• An augmented arborescence formulation for the two-level network design problem (Q1599298) (← links)
• Design of survivable networks with vulnerability constraints (Q1698886) (← links)
• A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
• Optimizing splitter and fiber location in a multilevel optical FTTH network (Q1926952) (← links)
• Two-level hub Steiner trees (Q2059893) (← links)
• An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model (Q2116857) (← links)
• Optimal hierarchical system of a grid road network (Q2267312) (← links)
• A branch and cut algorithm for the hierarchical network design problem (Q2379520) (← links)
• The multi-weighted Steiner tree problem: A reformulation by intersection (Q2483504) (← links)
• Towards optimizing the deployment of optical access networks (Q2513732) (← links)
• Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
• The Two Level Network Design Problem with Secondary Hop Constraints (Q3091484) (← links)
• A Dual-Based Algorithm for Multi-Level Network Design (Q4302659) (← links)
• Parallel algorithms for a multi-level network optimization problem (Q4819658) (← links)
• Multi-level Steiner Trees (Q4984869) (← links)
• Multi-Level Steiner Trees. (Q5140725) (← links)
• The multi-hour service system design problem (Q5925868) (← links)
• Multi-priority graph sparsification (Q6182885) (← links)