Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics

• المؤلفون الرئيسيون: LAU, Hoong Chuin, NGO, Trung Hieu, Nguyen, Bao Nguyen
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2006
• الموضوعات: Network design; Algorithm; Computational complexity; Logistics; Numerical Analysis and Scientific Computing; Operations Research, Systems Engineering and Industrial Engineering
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/1188; https://ink.library.smu.edu.sg/context/sis_research/article/2187/viewcontent/Finding_a_length_constrained_maximum_sum_2006_afv.pdf

We study the problem of finding a length-constrained maximum-density path in a tree with weight and length on each edge. This problem was proposed in [R.R. Lin, W.H. Kuo, K.M. Chao, Finding a length-constrained maximum-density path in a tree, Journal of Combinatorial Optimization 9 (2005) 147–156] a...