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

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