Pages that link to "Item:Q3404461"
From MaRDI portal
The following pages link to Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461):
Displaying 13 items.
- Designing WDM optical networks using branch-and-price (Q387309) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks (Q819071) (← 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)
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← 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)
- Multicommodity network design with discrete node costs (Q3418125) (← links)
- Network design with grooming constraints (Q3439127) (← links)
- A branch-and-cut approach for minimum cost multi-level network design (Q5957748) (← links)
