Reducing the hierarchical network design problem-Reference-Cited by-同舟云学术

Reducing the hierarchical network design problem

Published:1989-04 Issue:3 Volume:39 Page:332-344
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Duin Cees,Volgenant Anton

Publisher

Elsevier BV

Subject

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

Reference11 articles.

1. The hierarchical network design problem;Current;European Journal of Operational Research,1986

2. Reduction tests for the Steiner problem in graphs;Duin,1986

3. Some generalizations of the Steiner problem in graphs;Duin;Networks,1987

4. An edge elimination test for the Steiner problem in graphs;Duin,1988

5. A note on two problems in connexion with graphs;Dijkstra;Numerische Mathematik,1959

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

1. The Recoverable Robust Two-Level Network Design Problem;INFORMS Journal on Computing;2015-02

2. A Lagrangian relaxation approach for expansion of a highway network;Annals of Operations Research;2014-08-20

3. Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities;European Journal of Operational Research;2013-03

4. A branch and cut algorithm for the hierarchical network design problem;European Journal of Operational Research;2010-01

5. Optimal design of hierarchical networks with free main path extremes;Operations Research Letters;2008-05