On the optimality of algorithms for finite state sequential decision processes
From MaRDI portal
Publication:1228439
DOI10.1016/0022-247X(76)90096-2zbMath0333.90033MaRDI QIDQ1228439
Publication date: 1976
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C10: Integer programming
90B35: Deterministic scheduling theory in operations research
05-XX: Combinatorics
Related Items
General branch and bound, and its relation to \(A^*\) and \(AO^*\), 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, 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