Automating branch-and-bound for dynamic programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Automating branch-and-bound for dynamic programs


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 efficient versions 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.
No file

Dates and versions

hal-01301580 , version 1 (21-04-2016)



Jakob Puchinger, Peter J. Stuckey. Automating branch-and-bound for dynamic programs. PEPM '08- ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, Jan 2008, San Francisco, United States. pp.Pages 81-89 ⟨10.1145/1328408.1328421⟩. ⟨hal-01301580⟩
17 View
1 Download



Gmail Facebook Twitter LinkedIn More