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

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

Full description

Saved in:
Bibliographic Details
Main Authors: LAU, Hoong Chuin, NGO, Trung Hieu, Nguyen, Bao Nguyen
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2006
Subjects:
Network design
Algorithm
Computational complexity
Logistics
Numerical Analysis and Scientific Computing
Operations Research, Systems Engineering and Industrial Engineering
Online Access: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
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

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

Similar Items