The Generalized Regenerator Location Problem

DOI10.1287/ijoc.2014.0621zbMath1329.90026OpenAlexW2020049604WikidataQ62048265 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 cutmulticommodity flowextended formulationsoptical network designheuristics regenerator location

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Related Items (9)

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 ⋮ A variable neighborhood search for the network design problem with relays ⋮ Regenerator Location Problem in Flexible Optical Networks ⋮ Exact Approaches for Network Design Problems with Relays ⋮ The Optimal Design of Low-Latency Virtual Backbones ⋮ Regenerator location problem: polyhedral study and effective branch-and-cut algorithms ⋮ A branch-and-Benders-cut approach for the fault tolerant regenerator location problem

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

This page was built for publication: The Generalized Regenerator Location Problem