A decomposition algorithm for the ring spur assignment problem-Reference-Cited by-同舟云学术

A decomposition algorithm for the ring spur assignment problem

Published:2012-09-25 Issue:1 Volume:20 Page:119-139
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Carroll Paula¹,McGarraghy Seán¹

Affiliation:

1. Centre for Business Analytics; Management Information Systems; Quinn School of Business; University College Dublin; Belfield Dublin 4 Ireland

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/j.1475-3995.2012.00867.x/fullpdf

Reference27 articles.

1. The capacitated m-ring-star problem;Baldacci;Operations Research,2007

2. Future high-capacity optical telecommunication networks;Bayvel;Philosophical Transactions A: Mathematical Physical and Engineering Sciences,2000

3. Dense wavelength division multiplexing networks: principles and applications;Brackett;Selected Areas in Communications, IEEE Journal on,1990

4. Carroll , P. McGarraghy , S. 2009b Investigation of the ring spur assignment problem Bigi , G. Frangioni , A. Scutellà , M. Proceedings of INOC 2009 Pisa, Italy, MB1-3 http://www.di.unipi.it/optimize/Events/proceedings/M/B/1/MB13.pdf

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

1. Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon;Transportation Research Part E: Logistics and Transportation Review;2021-05

2. The Ring Spur Assignment Problem: New formulation, valid inequalities and a branch-and-cut approach;Computers & Operations Research;2017-12

3. The ring/κ-rings network design problem: Model and branch-and-cut algorithm;Networks;2016-06-28

4. Hierarchical Survivable Network Design Problems;Electronic Notes in Discrete Mathematics;2016-06

5. A branch-and-cut algorithm for two-level survivable network design problems;Computers & Operations Research;2016-03