Lagrangean bounds for the optimum communication spanning tree problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s11750-009-0112-5
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- R. K. Ahuja & V. V. S. Murty, 1987. "Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem," Transportation Science, INFORMS, vol. 21(3), pages 163-170, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Marín, Alfredo, 2011. "The discrete facility location problem with balanced allocation of customers," European Journal of Operational Research, Elsevier, vol. 210(1), pages 27-38, April.
- Zetina, Carlos Armando & Contreras, Ivan & Fernández, Elena & Luna-Mota, Carlos, 2019. "Solving the optimum communication spanning tree problem," European Journal of Operational Research, Elsevier, vol. 273(1), pages 108-117.
- Christian Tilk & Stefan Irnich, 2016. "Combined Column-and-Row-Generation for the Optimal Communication Spanning Tree Problem," Working Papers 1613, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
- Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Yogesh Kumar Agarwal & Prahalad Venkateshan, 2019. "New Valid Inequalities for the Optimal Communication Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 268-284, April.
- Li, Gang & Balakrishnan, Anantaram, 2016. "Models and algorithms for network reduction," European Journal of Operational Research, Elsevier, vol. 248(3), pages 930-942.
- Hui Chen & Ann Melissa Campbell & Barrett W. Thomas, 2008. "Network design for time‐constrained delivery," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(6), pages 493-515, September.
- Richard Church & John Current, 1993. "Maximal covering tree problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 129-142, February.
- Zetina, Carlos Armando & Contreras, Ivan & Fernández, Elena & Luna-Mota, Carlos, 2019. "Solving the optimum communication spanning tree problem," European Journal of Operational Research, Elsevier, vol. 273(1), pages 108-117.
- Christian Tilk & Stefan Irnich, 2016. "Combined Column-and-Row-Generation for the Optimal Communication Spanning Tree Problem," Working Papers 1613, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
- Prabha Sharma, 2006. "Algorithms for the optimum communication spanning tree problem," Annals of Operations Research, Springer, vol. 143(1), pages 203-209, March.
More about this item
Keywords
Network design; Lagrangean relaxation; Heuristics; 90B10; 90B18; 90C10;All these keywords.
JEL classification:
Statistics
Access and download statisticsCorrections
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:topjnl:v:18:y:2010:i:1:p:140-157. 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.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.