On the optimality of algorithms for finite state sequential decision processes

DOI10.1016/0022-247X(76)90096-2zbMath0333.90033OpenAlexW1971995715MaRDI QIDQ1228439

Toshihide Ibaraki

Publication date: 1976

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(76)90096-2

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorics (05-XX)

Related Items (5)

The principle of optimality in the design of efficient algorithms ⋮ Dynamic programming is optimal for certain sequential decision processes ⋮ A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures ⋮ General branch and bound, and its relation to \(A^*\) and \(AO^*\) ⋮ The application of automated reasoning to formal models of combinatorial optimization

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Classes of discrete optimization problems and their decision problems
• Solvable classes of discrete dynamic programming
• Finite-State Processes and Dynamic Programming
• An Appraisal of Some Shortest-Path Algorithms
• Representation theorems for equivalent optimization problems

This page was built for publication: On the optimality of algorithms for finite state sequential decision processes