Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms-Reference-Cited by-同舟云学术

Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms

Published:2017-02 Issue:1 Volume:257 Page:25-40
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Li Xiangyong,Aneja Y.P.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference44 articles.

1. Fixed-charge transportation problem: Facets of the projection polyhedron;Agarwal;Operations Research,2012

2. Facets of combinatorial optimization: Festschrift for Martin Grötschel;Álvarez-Miranda,2013

3. Regenerator placement problem;Aneja,2012

4. On the set covering polytope: I. All the facets with coefficients in {0, 1, 2};Balas;Mathematical Programming,1989

5. On connected dominating sets of restricted diameter;Buchanan;European Journal of Operational Research,2014

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On regenerator site selection in translucent optical network design;Photonic Network Communications;2022-09-17

2. Traffic-Based Heuristics for Regenerator Placement in Translucent Dynamic Optical Networks;Applied Sciences;2022-04-27

3. Solving the regenerator location problem with an iterated greedy approach;Applied Soft Computing;2021-11

4. A new branch-and-cut approach for the generalized regenerator location problem;Annals of Operations Research;2020-07-16

5. The Optimal Design of Low-Latency Virtual Backbones;INFORMS Journal on Computing;2020-04-15