Exact and heuristic algorithms for dynamic tree simplification

DOI10.1007/s10852-005-0855-4zbMath1086.90001OpenAlexW2126162269MaRDI QIDQ2583510

Xiaodong Sun, Carlos Correa, Ivan Marsic

Publication date: 17 January 2006

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-005-0855-4

zbMATH Keywords

dynamic programmingvirtual worldsstructured data simplification

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic and exact algorithms for the precedence-constrained knapsack problem
• A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees