Algorithms to solve the knapsack constrained maximum spanning tree problem

DOI10.1080/00207160412331290667zbMath1062.90056OpenAlexW2050146290MaRDI 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

zbMATH Keywords

combinatorial optimizationminimum spanning tree problemKnapsack problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

Implicit cover inequalities

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

This page was built for publication: Algorithms to solve the knapsack constrained maximum spanning tree problem