The Steiner tree problem with hop constraints
Author
Abstract
Suggested Citation
DOI: 10.1023/A:1018967121276
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Gouveia, Luis & Requejo, Cristina, 2001. "A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 132(3), pages 539-552, August.
- Li, Xiangyong & Aneja, Y.P. & Huo, Jiazhen, 2012. "Using branch-and-price approach to solve the directed network design problem with relays," Omega, Elsevier, vol. 40(5), pages 672-679.
- Gouveia, Luis & Leitner, Markus & Ljubić, Ivana, 2014. "Hop constrained Steiner trees with multiple root nodes," European Journal of Operational Research, Elsevier, vol. 236(1), pages 100-112.
- Cabral, Edgar Alberto & Erkut, Erhan & Laporte, Gilbert & Patterson, Raymond A., 2007. "The network design problem with relays," European Journal of Operational Research, Elsevier, vol. 180(2), pages 834-844, July.
- Konak, Abdullah, 2012. "Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation," European Journal of Operational Research, Elsevier, vol. 218(3), pages 829-837.
- Nigam, Ashutosh & Agarwal, Yogesh K., 2014. "Optimal relay node placement in delay constrained wireless sensor network design," European Journal of Operational Research, Elsevier, vol. 233(1), pages 220-233.
- Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2009. "Optimal multicast route packing," European Journal of Operational Research, Elsevier, vol. 196(1), pages 351-359, July.
- Fu, Zhang-Hua & Hao, Jin-Kao, 2014. "Breakout local search for the Steiner tree problem with revenue, budget and hop constraints," European Journal of Operational Research, Elsevier, vol. 232(1), pages 209-220.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:321-345:10.1023/a:1018967121276. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.