Pages that link to "Item:Q1599298"

The following pages link to An augmented arborescence formulation for the two-level network design problem (Q1599298):

Displaying 9 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)
• A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
• Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities (Q2253496) (← 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)
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
• A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes (Q3091483) (← links)
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem (Q4319533) (← links)