The following pages link to The regenerator location problem (Q3057148):
Displaying 32 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Optimizing busy time on parallel machines (Q476900) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← 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)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- Branch-and-price approaches for the network design problem with relays (Q1651598) (← links)
- Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247) (← links)
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
- An exact solution framework for the minimum cost dominating tree problem (Q1800452) (← links)
- Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← 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)
- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (Q2827800) (← links)
- Online Optimization of Busy Time on Parallel Machines (Q2898056) (← links)
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
- Active and Busy Time Scheduling Problem: A Survey (Q3297831) (← links)
- The Generalized Regenerator Location Problem (Q3466768) (← links)
- Regenerator Location Problem in Flexible Optical Networks (Q4604897) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← 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)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- A branch-and-cut approach to solve the fault diagnosis problem with lazy spread and imperfect system information (Q6568395) (← links)
