scientific article; zbMATH DE number 2217849

MaRDI QIDQ5699588zbMATH OpenFDO

Authors Dmitrii Lozovanu

Publication date 26 October 2005

zbMATH Keywords

\(k\)-optimal treedynamic programming methodpacking knapsack problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1895857
• A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
• Algorithms to solve the knapsack constrained maximum spanning tree problem
• An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
• scientific article; zbMATH DE number 4023019

Cited in

(11)

• Two packing problems on \(k\)-matroid trees
• An efficient pruning algorithm for value independent knapsack problem using a DAG structure
• Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time
• A dynamic programming algorithm for tree-like weighted set packing problem
• The complexity of the node capacitated in-tree packing problem
• A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
• scientific article; zbMATH DE number 1769298 (Why is no real title available?)
• Algorithms to solve the knapsack constrained maximum spanning tree problem
• scientific article; zbMATH DE number 1895857 (Why is no real title available?)
• Capacitated dynamic programming: faster knapsack and graph algorithms
• Linear pseudo-polynomial factor algorithm for automaton constrained tree knapsack problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5699588)