Pages that link to "Item:Q5538317"

The following pages link to Finite-State Processes and Dynamic Programming (Q5538317):

Displaying 37 items.

• A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
• A polyhedral approach to the single row facility layout problem (Q378107) (← links)
• A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
• Toward a model for backtracking and dynamic programming (Q430838) (← links)
• Limitations of incremental dynamic programming (Q517805) (← links)
• A stronger model of dynamic programming algorithms (Q547305) (← links)
• A polyhedral study of triplet formulation for single row facility layout problem (Q602769) (← links)
• Efficient models for the facility layout problem (Q803026) (← links)
• Methods for the one-dimensional space allocation problem (Q916571) (← links)
• A new lower bound for the single row facility layout problem (Q1003774) (← links)
• On distributed search (Q1068555) (← links)
• Richard Bellman's contributions to computer science (Q1081590) (← links)
• The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
• Systolic processing for dynamic programming problems (Q1099090) (← links)
• Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
• On the optimality of algorithms for finite state sequential decision processes (Q1228439) (← links)
• A heuristic procedure for the single-row facility layout problem (Q1390259) (← links)
• Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
• Monotonicity and the principle of optimality (Q1838705) (← links)
• The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
• Disentangling relationships in symptom networks using matrix permutation methods (Q2141642) (← links)
• Effective categoricity of automatic equivalence and nested equivalence structures (Q2195573) (← links)
• Dynamic programming for the quadratic assignment problem on trees (Q2261718) (← links)
• Classes of discrete optimization problems and their decision problems (Q2265336) (← links)
• Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
• Sufficient and necessary conditions for solution finding in valuation-based systems (Q2302788) (← links)
• Solving sequential collective decision problems under qualitative uncertainty (Q2330008) (← links)
• Exact solution procedures for the balanced unidirectional cyclic layout problem (Q2482739) (← links)
• On the exact solution of a facility layout problem (Q2496073) (← links)
• The concept of state in discrete dynamic programming (Q2538061) (← links)
• Solvable classes of discrete dynamic programming (Q2563309) (← links)
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
• Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
• STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS (Q3439886) (← links)
• Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
• The sequencing of “related” jobs (Q5545166) (← links)
• A general framework for enumerating equivalence classes of solutions (Q6046942) (← links)