Pages that link to "Item:Q2379520"

The following pages link to A branch and cut algorithm for the hierarchical network design problem (Q2379520):

Displaying 12 items.

• Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
• The hierarchical network design problem with multiple primary paths (Q1278494) (← links)
• Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
• A branch-and-cut algorithm for capacitated network design problems (Q1806022) (← links)
• Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities (Q2253496) (← links)
• Balanced-flow algorithm for path network planning in hierarchical spaces (Q2283024) (← 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)
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
• (Q3786030) (← links)
• (Q4031976) (← links)
• A branch-and-cut approach for minimum cost multi-level network design (Q5957748) (← links)