Algorithms to solve the knapsack constrained maximum spanning tree problem (Q4663307): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207160412331290667
+Normal rank
@@ Property / OpenAlex ID @@
+W2050146290
@@ Property / OpenAlex ID: W2050146290 / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The knapsack problem: A survey
@@ Property / cites work: The knapsack problem: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and exact algorithms for the precedence-constrained knapsack problem
+Normal rank
@@ Property / cites work @@
+A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
+Normal rank