Pages that link to "Item:Q5957748"
From MaRDI portal
The following pages link to A branch-and-cut approach for minimum cost multi-level network design (Q5957748):
Displaying 8 items.
- Optimal design of hierarchical networks with free main path extremes (Q943800) (← links)
- A branch-and-bound algorithm to solve a multi-level network optimization problem (Q1398020) (← links)
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities (Q2253496) (← links)
- Optimal hierarchical system of a grid road network (Q2267312) (← links)
- A branch and cut algorithm for the hierarchical network design problem (Q2379520) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- A Dual-Based Algorithm for Multi-Level Network Design (Q4302659) (← links)