A common schema for dynamic programming and branch and bound algorithms

DOI10.1145/58562.59304MaRDI QIDQ3832081zbMATH OpenOpenAlexFDO

Authors Paul Helman

Publication date 1989

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/58562.59304

zbMATH Keywords

branch-and-boundcombinatorial optimizationcomplexity analysisdynamic programmingformal models of algorithmsparallel algorithmssearch strategies

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Dynamic programming (90C39)

Recommendations

• A Comprehensive Model of Dynamic Programming
• A stronger model of dynamic programming algorithms
• Toward a model for backtracking and dynamic programming
• scientific article; zbMATH DE number 43711
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis

Cited in

(9)

• The log bucking problem: A comparison of dynamic programming versus branch and bound
• The application of automated reasoning to formal models of combinatorial optimization
• Width, depth, and space: tradeoffs between branching and dynamic programming
• Sufficient and necessary conditions for solution finding in valuation-based systems
• Categories, relations and dynamic programming
• Toward a model for backtracking and dynamic programming
• Limitations of incremental dynamic programming
• A stronger model of dynamic programming algorithms
• Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.

This page was built for publication: A common schema for dynamic programming and branch and bound algorithms

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