A new branch-and-cut approach for the generalized regenerator location problem

DOI10.1007/s10479-020-03721-6zbMath1455.90027OpenAlexW3042514062MaRDI QIDQ827283

Xiangyong Li, Yash P. Aneja

Publication date: 7 January 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-020-03721-6

zbMATH Keywords

branch and cutlocationfacetsoptical network designregenerator placement

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Related Items (2)

A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review

Uses Software

• CPLEX
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks
• Design of survivable IP-over-optical networks
• Integer linear programming models for topology optimization in sheet metal design
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
• An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
• The regenerator location problem
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• The Generalized Regenerator Location Problem
• The Maximum Weight Connected Subgraph Problem

This page was built for publication: A new branch-and-cut approach for the generalized regenerator location problem