The regenerator location problem

DOI10.1002/net.20366zbMath1200.90113OpenAlexW3123635721WikidataQ62048302 ScholiaQ62048302MaRDI QIDQ3057148

Ivana Ljubić, Si Chen, S. Raghu Raghavan

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20366

zbMATH Keywords

heuristicsbranch-and-cutgreedyoptical network designmaximum leaf spanning tree problemSteiner arborescence problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80) Analytic circuit theory (94C05)

Related Items (31)

Complexity of the maximum leaf spanning tree problem on planar and regular graphs ⋮ A new branch-and-cut approach for the generalized regenerator location problem ⋮ Online Optimization of Busy Time on Parallel Machines ⋮ The Generalized Regenerator Location Problem ⋮ Branch-and-price approaches for the network design problem with relays ⋮ Spanning trees with a constraint on the number of leaves. A new formulation ⋮ A variable neighborhood search for the network design problem with relays ⋮ A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets ⋮ Online regenerator placement ⋮ Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem ⋮ Biased random-key genetic algorithms with applications in telecommunications ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ On the complexity of the regenerator location problem treewidth and other parameters ⋮ Regenerator Location Problem in Flexible Optical Networks ⋮ Optimizing regenerator cost in traffic grooming ⋮ Exact Approaches for Network Design Problems with Relays ⋮ Optimizing busy time on parallel machines ⋮ Online optimization of busy time on parallel machines ⋮ Active and Busy Time Scheduling Problem: A Survey ⋮ The Optimal Design of Low-Latency Virtual Backbones ⋮ Regenerator location problem: polyhedral study and effective branch-and-cut algorithms ⋮ On the complexity of the regenerator cost problem in general networks with traffic grooming ⋮ Improved heuristics for the regenerator location problem ⋮ Minimizing total busy time in parallel scheduling with application to optical networks ⋮ MIP models for connected facility location: a theoretical and computational study ⋮ Reformulations and solution algorithms for the maximum leaf spanning tree problem ⋮ Complexity of independency and cliquy trees ⋮ A branch-and-Benders-cut approach for the fault tolerant regenerator location problem ⋮ An exact solution framework for the minimum cost dominating tree problem ⋮ On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks ⋮ Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set

Cites Work

• Unnamed Item
• Facets of two Steiner arborescence polyhedra
• An exact algorithm for the maximum leaf spanning tree problem.
• The maximum-leaf spanning tree problem: Formulations and facets
• A catalog of steiner tree formulations
• Obtaining optimal k -cardinality trees fast
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: The regenerator location problem