Algorithms to solve the knapsack constrained maximum spanning tree problem
From MaRDI portal
Publication:4663307
DOI10.1080/00207160412331290667zbMath1062.90056MaRDI QIDQ4663307
Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka
Publication date: 30 March 2005
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160412331290667
Related Items
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Heuristic and exact algorithms for the precedence-constrained knapsack problem
- The knapsack problem: A survey
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem