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

 _    _    _    _     ______    _____    _____    
| \  / || | || | ||  /_   _//  |  ___|| |  __ \\  
|  \/  || | || | ||  `-| |,-   | ||__   | |  \ || 
| .  . || | \\_/ ||    | ||    | ||__   | |__/ || 
|_|\/|_||  \____//     |_||    |_____|| |_____//  
`-`  `-`    `---`      `-`'    `-----`   -----`