Dynamic Programming is Optimal for Nonserial Optimization Problems

DOI10.1137/0211004MaRDI QIDQ3937164zbMATH OpenOpenAlexFDO

Authors Arnon Rosenthal

Publication date 1982

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0211004

zbMATH Keywords

Bellman's principle of optimalitydiscrete optimizationexponential lower boundlimited form of decompositionnonoverlapping comparison algorithmsnonserial dynamic programmingperfect elimination graph

Mathematics Subject Classification ID

Dynamic programming (90C39)

Cited in

(10)

• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• The principle of optimality in the design of efficient algorithms
• Systolic processing for dynamic programming problems
• Nonserial dynamic programming formulations of satisfiability
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Dynamic programming is optimal for certain sequential decision processes
• Exact algorithms for the Hamiltonian cycle problem in planar graphs
• A Comprehensive Model of Dynamic Programming
• A stronger model of dynamic programming algorithms
• Power indices and easier hard problems

This page was built for publication: Dynamic Programming is Optimal for Nonserial Optimization Problems

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