Skip to main content
SpringerLink
Log in

Refining Partial Invalidations for Indexed Algebraic Dynamic Programming

  • Conference paper
  • First Online:
Machine Learning, Optimization, and Big Data (MOD 2017)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10710))

Included in the following conference series:

  • 2976 Accesses

Abstract

We consider dynamic programs modelled in a variant of the Algebraic Dynamic Programming (ADP) framework which allows us to develop general purpose solvers for Dynamic Programming problems. In such dynamic programs the information accumulated in memoization tables is usually lost if the input data of the problem instance changes. We analyze those changes and how they affect the information stored for subproblems of a dynamic program. We then present the theory for a new algorithm for partial invalidation and incremental evaluation of ADPs based on a previous simpler algorithm. The new algorithm should reduce the amount of discarded information in Dynamic Programming tables and to speed up the reevaluation of dynamic programs in the face of changing inputs. In future work we will integrate the algorithms into a framework currently under development to conduct thorough experiments on their practical efficieny.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)

    MATH  Google Scholar 

  2. Giegerich, R., Meyer, C.: Algebraic Dynamic Programming. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol. 2422, pp. 349–364. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45719-4_24

    Chapter  MATH  Google Scholar 

  3. Giegerich, R., Meyer, C., Steffen, P.: A discipline of dynamic programming over sequence data. Sci. Comput. Program. 51(3), 215–263 (2004)

    Article  MathSciNet  Google Scholar 

  4. Sauthoff, G., Janssen, S., Giegerich, R.: Bellman’s GAP: a declarative language for dynamic programming. In: Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming, pp. 29–40. ACM (2011)

    Google Scholar 

  5. Sauthoff, G., Möhl, M., Janssen, S., Giegerich, R.: Bellman’s GAP–a language and compiler for dynamic programming in sequence analysis. Bioinformatics 29(5), 551–560 (2013)

    Article  Google Scholar 

  6. Algebraic dynamic programming for multiple context-free grammars: Riechert, M., Höner zu Siederdissen, C., Stadler, P.F. Theoret. Comput. Sci. 639, 91–109 (2016)

    Article  MathSciNet  Google Scholar 

  7. Höner zu Siederdissen, C., Prohaska, S.J., Stadler, P.F.: Dynamic Programming for Set Data Types. In: Campos, S. (ed.) BSB 2014. LNCS, vol. 8826, pp. 57–64. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-12418-6_8

    Chapter  Google Scholar 

  8. Prohaska, S.J., Stadler, P.F.: Algebraic dynamic programming over general data structures. BMC Bioinform. 16(19), 1–13 (2015)

    Google Scholar 

  9. Prins, C., Labadi, N., Reghioui, M.: Tour splitting algorithms for vehicle routing problems. Int. J. Prod. Res. 47(2), 507–535 (2009)

    Article  Google Scholar 

  10. Bacher, C., Raidl, G.R.: Extending algebraic dynamic programming for modelling and solving combinatorial optimization problems. Technical report, Algorithms and Complexity Group, TU Wien, Vienna, Austria (2017). in Preparation)

    Google Scholar 

  11. Sauthoff, G.: Bellman’s GAP: A 2nd Generation Language and System for Algebraic Dynamic Programming. Ph.D. thesis, Bielefeld University (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Algorithms and Complexity Group, TU Wien, Vienna, Austria

    Christopher Bacher & Günther R. Raidl

Authors
  1. Christopher Bacher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Günther R. Raidl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christopher Bacher .

Editor information

Editors and Affiliations

  1. University of Catania, Catania, Italy

    Giuseppe Nicosia

  2. University of Florida, Gainesville, FL, USA

    Panos Pardalos

  3. University of Catania, Catania, Italy

    Giovanni Giuffrida

  4. Harvard University, Cambridge, MA, USA

    Renato Umeton

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bacher, C., Raidl, G.R. (2018). Refining Partial Invalidations for Indexed Algebraic Dynamic Programming. In: Nicosia, G., Pardalos, P., Giuffrida, G., Umeton, R. (eds) Machine Learning, Optimization, and Big Data. MOD 2017. Lecture Notes in Computer Science(), vol 10710. Springer, Cham. https://doi.org/10.1007/978-3-319-72926-8_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72926-8_47

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72925-1

  • Online ISBN: 978-3-319-72926-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation