The Generalized Regenerator Location Problem

DOI10.1287/ijoc.2014.0621zbMath1329.90026WikidataQ62048265 ScholiaQ62048265MaRDI QIDQ3466768

Ivana Ljubić, Si Chen, S. Raghu Raghavan

Publication date: 25 January 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2014.0621

zbMATH Keywords

branch and cut; multicommodity flow; extended formulations; optical network design; heuristics regenerator location

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C11: Mixed integer programming

90B18: Communication networks in operations research

90B80: Discrete location and assignment

Related Items

Regenerator Location Problem in Flexible Optical Networks, Exact Approaches for Network Design Problems with Relays, The Optimal Design of Low-Latency Virtual Backbones, A new branch-and-cut approach for the generalized regenerator location problem, Leaf realization problem, caterpillar graphs and prefix normal words, Branch-and-price approaches for the network design problem with relays, Regenerator location problem: polyhedral study and effective branch-and-cut algorithms, A branch-and-Benders-cut approach for the fault tolerant regenerator location problem, A variable neighborhood search for the network design problem with relays

Uses Software

• CPLEX

Cites Work

• Reformulations and solution algorithms for the maximum leaf spanning tree problem
• Minimal spanning trees with a constraint on the number of leaves
• On implementing the push-relabel method for the maximum flow problem
• Online regenerator placement
• The regenerator location problem
• Maximal Flow Through a Network
• Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests