Pages that link to "Item:Q3466768"
From MaRDI portal
The following pages link to The Generalized Regenerator Location Problem (Q3466768):
Displaying 16 items.
- Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators (Q286692) (← links)
- A new branch-and-cut approach for the generalized regenerator location problem (Q827283) (← links)
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- Leaf realization problem, caterpillar graphs and prefix normal words (Q1637224) (← links)
- Branch-and-price approaches for the network design problem with relays (Q1651598) (← links)
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
- A branch-and-Benders-cut approach for the fault tolerant regenerator location problem (Q2289917) (← links)
- A variable neighborhood search for the network design problem with relays (Q2403270) (← links)
- Online regenerator placement (Q2408557) (← links)
- The regenerator location problem (Q3057148) (← links)
- Regenerator Location Problem in Flexible Optical Networks (Q4604897) (← links)
- Exact Approaches for Network Design Problems with Relays (Q5137444) (← links)
- The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
- Improved heuristics for the regenerator location problem (Q5175825) (← links)
- New formulations for two location problems with interconnected facilities (Q6128897) (← links)
- A branch-and-cut approach to solve the fault diagnosis problem with lazy spread and imperfect system information (Q6568395) (← links)
