Finite-State Processes and Dynamic Programming
From MaRDI portal
Cited in
(44)- Monotonicity and the principle of optimality
- A Comprehensive Model of Dynamic Programming
- The application of automated reasoning to formal models of combinatorial optimization
- Systolic processing for dynamic programming problems
- A method for approximating dynamical processes by finite-state systems
- Network-based approximate linear programming for discrete optimization
- A STUDY ON SEQUENTIAL DECISION PROCESS
- Effective categoricity of automatic equivalence and nested equivalence structures
- Width, depth, and space: tradeoffs between branching and dynamic programming
- Classes of discrete optimization problems and their decision problems
- Toward a model for backtracking and dynamic programming
- Spine layout design
- A stronger model of dynamic programming algorithms
- Solvable classes of discrete dynamic programming
- The sequencing of “related” jobs
- Disentangling relationships in symptom networks using matrix permutation methods
- Polymorphic dynamic programming by algebraic shortcut fusion
- Dynamic programming with convexity, concavity and sparsity
- A computational study and survey of methods for the single-row facility layout problem
- A polyhedral approach to the single row facility layout problem
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- Domain-independent dynamic programming
- A polyhedral study of triplet formulation for single row facility layout problem
- Richard Bellman's contributions to computer science
- From the theory to the tools: parallel dynamic programming
- Efficient models for the facility layout problem
- Methods for the one-dimensional space allocation problem
- A new lower bound for the single row facility layout problem
- Exact solution procedures for the balanced unidirectional cyclic layout problem
- The concept of state in discrete dynamic programming
- Categories, relations and dynamic programming
- Fast simulated annealing for single-row equidistant facility layout
- Global approaches for facility layout and VLSI floorplanning
- A heuristic procedure for the single-row facility layout problem
- On distributed search
- Sufficient and necessary conditions for solution finding in valuation-based systems
- On the optimality of algorithms for finite state sequential decision processes
- Limitations of incremental dynamic programming
- Dynamic programming for the quadratic assignment problem on trees
- On the exact solution of a facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- The principle of optimality in the design of efficient algorithms
- Solving sequential collective decision problems under qualitative uncertainty
- STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS
This page was built for publication: Finite-State Processes and Dynamic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5538317)
