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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207160412331290667 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050146290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knapsack problem: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and exact algorithms for the precedence-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
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 / rank
 
Normal rank

Latest revision as of 19:07, 7 June 2024

scientific article; zbMATH DE number 2150695
Language Label Description Also known as
English
Algorithms to solve the knapsack constrained maximum spanning tree problem
scientific article; zbMATH DE number 2150695

    Statements

    Identifiers