Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints-Reference-Cited by-同舟云学术

Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

Published:1998-05 Issue:2 Volume:10 Page:180-188
ISSN:1091-9856
Container-title:INFORMS Journal on Computing
language:en
Short-container-title:INFORMS Journal on Computing

Author:

Gouveia Luis

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

General Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.10.2.180

Reference26 articles.

1. Using a Hop-Constrained Model to Generate Alternative Communication Network Design

2. An algorithm for the resource constrained shortest path problem

3. The K-Walk Polyhedron

4. Solving the Steiner Tree Problem on a Graph Using Branch and Cut

5. Dahl G. , Realfsen B. Curve Approximation Constrained Shortest Path Problems. (1996) (Institute of Informatics, University of Oslo, Norway) . Report 6

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

1. Network design with vulnerability constraints and probabilistic edge reliability;Networks;2024-04-27

2. Common-Flow Formulations for the Diameter Constrained Spanning and Steiner Tree Problems;International Series in Operations Research & Management Science;2024

3. Operational Research: methods and applications;Journal of the Operational Research Society;2023-12-27

4. The travelling salesman problem with positional consistency constraints: An application to healthcare services;European Journal of Operational Research;2023-08

5. On solving bi-objective constrained minimum spanning tree problems;Journal of Global Optimization;2023-05-25