Pages that link to "Item:Q1121181"

The following pages link to Reducing the hierarchical network design problem (Q1121181):

Displaying 11 items.

• A Lagrangian relaxation approach for expansion of a highway network (Q512983) (← links)
• Optimal design of hierarchical networks with free main path extremes (Q943800) (← links)
• An edge elimination test for the Steiner problem in graphs (Q1116902) (← links)
• The multi-weighted Steiner tree problem (Q1179753) (← links)
• An addendum to the hierarchical network design problem (Q1268252) (← links)
• A review of extensive facility location in networks (Q1278421) (← links)
• Algorithms for a multi-level network optimization problem (Q1307817) (← links)
• Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772) (← links)
• The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
• A branch and cut algorithm for the hierarchical network design problem (Q2379520) (← links)
• The multi-weighted spanning tree problem (Q6085702) (← links)