Minimum diameter cost-constrained Steiner trees
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-013-9611-2
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
- Refael Hassin, 1992. "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 36-42, February.
- Sartaj Sahni, 1977. "General Techniques for Combinatorial Approximation," Operations Research, INFORMS, vol. 25(6), pages 920-936, December.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Bang Ye Wu & Chen-Wan Lin, 2015. "On the clustered Steiner tree problem," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 370-386, August.
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.- Li, Jianping & Ge, Yu & He, Shuai & Lichen, Junran, 2014. "Approximation algorithms for constructing some required structures in digraphs," European Journal of Operational Research, Elsevier, vol. 232(2), pages 307-314.
- Shisheng Li & T.C.E. Cheng & C.T. Ng & Jinjiang Yuan, 2017. "Two‐agent scheduling on a single sequential and compatible batching machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(8), pages 628-641, December.
- Michael Zabarankin & Stan Uryasev & Robert Murphey, 2006. "Aircraft routing under the risk of detection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 728-747, December.
- Li Guan & Jianping Li & Weidong Li & Junran Lichen, 2019. "Improved approximation algorithms for the combination problem of parallel machine scheduling and path," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 689-697, October.
- Esaignani Selvarajah & Rui Zhang, 2014. "Supply chain scheduling to minimize holding costs with outsourcing," Annals of Operations Research, Springer, vol. 217(1), pages 479-490, June.
- Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
- Briskorn, Dirk & Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph & Pinedo, Michael, 2010. "Complexity of single machine scheduling subject to nonnegative inventory constraints," European Journal of Operational Research, Elsevier, vol. 207(2), pages 605-619, December.
- M. Reza Khani & Mohammad R. Salavatipour, 2016. "Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 669-685, February.
- Imed Kacem & Hans Kellerer & Yann Lanuel, 2015. "Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 403-412, October.
- Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
- Bo Chen & Xiaotie Deng & Wenan Zang, 2004. "On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 85-95, March.
- Tomášek, M. & Mikoláš, V., 1979. "Remarks on the density functional approach to the inhomogeneous electron gas," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 95(3), pages 547-560.
- Boaz Golany & Moshe Kress & Michal Penn & Uriel G. Rothblum, 2012. "Network Optimization Models for Resource Allocation in Developing Military Countermeasures," Operations Research, INFORMS, vol. 60(1), pages 48-63, February.
- Amir Elalouf, 2014. "Fast approximation algorithms for routing problems with hop-wise constraints," Annals of Operations Research, Springer, vol. 222(1), pages 279-291, November.
- Nir Halman & Mikhail Y. Kovalyov & Alain Quilliot & Dvir Shabtay & Moshe Zofi, 2019. "Bi-criteria path problem with minimum length and maximum survival probability," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 469-489, June.
- Perrot, F., 1979. "Zero-temperature equation of state of metals in the statistical model with density gradient correction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 98(3), pages 555-565.
- Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
- Hanif D. Sherali & Antoine G. Hobeika & Sasikul Kangwalklai, 2003. "Time-Dependent, Label-Constrained Shortest Path Problems with Applications," Transportation Science, INFORMS, vol. 37(3), pages 278-293, August.
- Elalouf, Amir & Levner, Eugene & Cheng, T.C.E., 2013. "Routing and dispatching of multiple mobile agents in integratedenterprises," International Journal of Production Economics, Elsevier, vol. 145(1), pages 96-106.
- Faramroze G. Engineer & George L. Nemhauser & Martin W. P. Savelsbergh, 2011. "Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 105-119, February.
More about this item
Keywords
Steiner Tree; Minimum Diameter; Multicast Tree; Steiner Tree Problem; Objective Tree;All these keywords.
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:jcomop:v:27:y:2014:i:1:d:10.1007_s10878-013-9611-2. 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.