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

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...

全面介紹

Saved in:
書目詳細資料
Main Authors: LAU, Hoong Chuin, NGO, Trung Hieu, Nguyen, Bao Nguyen
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 2006
主題:
在線閱讀: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
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English

相似書籍