Pages that link to "Item:Q4302659"

The following pages link to A Dual-Based Algorithm for Multi-Level Network Design (Q4302659):

Displaying 26 items.

• Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
• Optimal design of hierarchical networks with free main path extremes (Q943800) (← links)
• Iterative improvement methods for a multiperiod network design problem (Q1303714) (← links)
• Algorithms for a multi-level network optimization problem (Q1307817) (← links)
• A branch-and-bound algorithm to solve a multi-level network optimization problem (Q1398020) (← 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)
• Multi-level facility location problems (Q1754251) (← links)
• Optimizing splitter and fiber location in a multilevel optical FTTH network (Q1926952) (← links)
• A modified algorithm of multiplex networks generation based on overlapped links (Q2157968) (← links)
• Optimal hierarchical system of a grid road network (Q2267312) (← links)
• Two-level rectilinear Steiner trees (Q2362106) (← links)
• A global optimization algorithm for reliable network design (Q2379515) (← 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)
• A taxonomy of multilayer network design and a survey of transportation and telecommunication applications (Q2673552) (← links)
• A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes (Q3091483) (← links)
• The Two Level Network Design Problem with Secondary Hop Constraints (Q3091484) (← links)
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem (Q4319533) (← links)
• Methodological Advances and New Formulations for Bilevel Network Design Problems (Q4685727) (← links)
• Parallel algorithms for a multi-level network optimization problem (Q4819658) (← links)
• An Algorithm for the Design of Multitype Concentrator Networks (Q5289661) (← links)
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
• Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)
• A branch-and-cut approach for minimum cost multi-level network design (Q5957748) (← links)