The regenerator location problem

DOI10.1002/NET.20366MaRDI QIDQ3057148zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Si Chen, Ivana Ljubić, S. 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

branch-and-cutgreedyheuristicsmaximum leaf spanning tree problemoptical network designSteiner arborescence problem

Mathematics Subject Classification ID

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

Recommendations

• The Generalized Regenerator Location Problem
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
• Improved heuristics for the regenerator location problem
• A new branch-and-cut approach for the generalized regenerator location problem
• A branch-and-Benders-cut approach for the fault tolerant regenerator location problem

Cites work

• A catalog of steiner tree formulations
• An exact algorithm for the maximum leaf spanning tree problem.
• Depth-First Search and Linear Graph Algorithms
• Facets of two Steiner arborescence polyhedra
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Obtaining optimal \(k\)-cardinality trees fast
• The maximum-leaf spanning tree problem: Formulations and facets

Cited in

(33)

• Branch-and-price approaches for the network design problem with relays
• Spanning trees with a constraint on the number of leaves. A new formulation
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
• An exact solution framework for the minimum cost dominating tree problem
• Biased random-key genetic algorithms with applications in telecommunications
• Complexity of independency and cliquy trees
• A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
• A variable neighborhood search for the network design problem with relays
• Online regenerator placement
• Complexity of the maximum leaf spanning tree problem on planar and regular graphs
• On the complexity of approximation and online scheduling problems with applications to optical networks
• On the complexity of the regenerator location problem -- treewidth and other parameters (extended abstract)
• Online optimization of busy time on parallel machines. (Extended abstract)
• Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
• Active and busy time scheduling problem: a survey
• The Generalized Regenerator Location Problem
• Regenerator location problem in flexible optical networks
• Optimizing busy time on parallel machines
• Online optimization of busy time on parallel machines
• Efficient local search based on dynamic connectivity maintenance for minimum connected dominating set
• A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
• Exact approaches for network design problems with relays
• The optimal design of low-latency virtual backbones
• Improved heuristics for the regenerator location problem
• On the complexity of the regenerator cost problem in general networks with traffic grooming
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Optimizing regenerator cost in traffic grooming
• A branch-and-cut approach to solve the fault diagnosis problem with lazy spread and imperfect system information
• Minimizing total busy time in parallel scheduling with application to optical networks
• MIP models for connected facility location: a theoretical and computational study
• A new branch-and-cut approach for the generalized regenerator location problem
• On the complexity of the regenerator location problem treewidth and other parameters
• Reformulations and solution algorithms for the maximum leaf spanning tree problem

This page was built for publication: The regenerator location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057148)