Finite-State Processes and Dynamic Programming
From MaRDI portal
Publication:5538317
DOI10.1137/0115060zbMath0155.28701OpenAlexW2048586177MaRDI QIDQ5538317
Publication date: 1967
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0115060
Related Items
The sequencing of “related” jobs, Richard Bellman's contributions to computer science, The principle of optimality in the design of efficient algorithms, A method for approximating dynamical processes by finite-state systems, Disentangling relationships in symptom networks using matrix permutation methods, Systolic processing for dynamic programming problems, A STUDY ON SEQUENTIAL DECISION PROCESS, Categories, relations and dynamic programming, A computational study and survey of methods for the single-row facility layout problem, Fast simulated annealing for single-row equidistant facility layout, A polyhedral study of triplet formulation for single row facility layout problem, A polyhedral approach to the single row facility layout problem, A heuristic procedure for the single-row facility layout problem, A general framework for enumerating equivalence classes of solutions, Effective categoricity of automatic equivalence and nested equivalence structures, A branch-and-bound algorithm for the single-row equidistant facility layout problem, Toward a model for backtracking and dynamic programming, Methods for the one-dimensional space allocation problem, Network-Based Approximate Linear Programming for Discrete Optimization, Dynamic programming with convexity, concavity and sparsity, From the theory to the tools: parallel dynamic programming, Limitations of incremental dynamic programming, Exact solution procedures for the balanced unidirectional cyclic layout problem, Spine layout design, A stronger model of dynamic programming algorithms, Dynamic programming for the quadratic assignment problem on trees, Classes of discrete optimization problems and their decision problems, On the exact solution of a facility layout problem, On the optimality of algorithms for finite state sequential decision processes, Width, depth, and space: tradeoffs between branching and dynamic programming, Global Approaches for Facility Layout and VLSI Floorplanning, A new lower bound for the single row facility layout problem, Sufficient and necessary conditions for solution finding in valuation-based systems, The concept of state in discrete dynamic programming, Solvable classes of discrete dynamic programming, Monotonicity and the principle of optimality, Solving sequential collective decision problems under qualitative uncertainty, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, The application of automated reasoning to formal models of combinatorial optimization, A Comprehensive Model of Dynamic Programming, Efficient models for the facility layout problem, STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS, On distributed search
