Pages that link to "Item:Q1398020"
From MaRDI portal
The following pages link to A branch-and-bound algorithm to solve a multi-level network optimization problem (Q1398020):
Displaying 11 items.
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
- Solving to optimality the uncapacitated fixed-charge network flow problem (Q1265864) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
- Optimizing splitter and fiber location in a multilevel optical FTTH network (Q1926952) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- (Q3330961) (← links)
- A BRANCH-AND-BOUND ALGORITHM FOR A PSEUDO-BOOLEAN OPTIMIZATION PROBLEM WITH BLACK-BOX FUNCTIONS (Q3388290) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- (Q4031976) (← links)
- A branch-and-cut approach for minimum cost multi-level network design (Q5957748) (← links)