Automating branch-and-bound for dynamic programs

Authors:
Jakob Puchinger;Peter J. Stuckey
Affiliations:
University of Melbourne, Australia, Melbourne, Australia;University of Melbourne, Australia, Melbourne, Australia
Venue:
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Year:
2008

Citing 10
Cited 7

Speeding up dynamic programming algorithms for finding optimal lattice paths

SIAM Journal on Applied Mathematics
An improved discrete dynamic programming algorithm for allocating resources among interdependent projects

Management Science
Dynamic Programming via Static Incrementalization

Higher-Order and Symbolic Computation
Algebraic Dynamic Programming

AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Management Science
Dynamic Programming

Dynamic Programming
Compiling Comp Ling: practical weighted dynamic programming and the Dyna language

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Dynamic Programming to Minimize the Maximum Number of Open Stacks

INFORMS Journal on Computing
Comparing best-first search and dynamic programming for optimal multiple sequence alignment

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Tabling in mercury: design and implementation

PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages

A Short Cut to Optimal Sequences

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Lock-free parallel dynamic programming

Journal of Parallel and Distributed Computing
Solving Talent Scheduling with Dynamic Programming

INFORMS Journal on Computing
Exploiting subproblem dominance in constraint programming

Constraints
Automatically exploiting subproblem equivalence in constraint programming

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A complete solution to the Maximum Density Still Life Problem

Artificial Intelligence
Optimal guillotine layout

Proceedings of the 2012 ACM symposium on Document engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic programming is a powerful technique for solving optimization problems efficiently. We consider a dynamic program as simply a recursive program that is evaluated with memoization and lookup of answers. In this paper we examine how, given a function calculating a bound on the value of the dynamic program, we can optimize the compilation of the dynamic program function. We show how to automatically transform a dynamic program to a number of more efficientversions making use of the bounds function. We compare the different transformed versions on a number of example dynamic programs, and show the benefits in search space and time that can result.