Contribution to nonserial dynamic programming

Cites work

scientific article; zbMATH DE number 3159208 (Why is no real title available?)
scientific article; zbMATH DE number 3301979 (Why is no real title available?)
scientific article; zbMATH DE number 3198484 (Why is no real title available?)
A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming
Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems

Cited in

(33)

A theorem in nonserial dynamic programming
A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
Decision making with multiple objectives using GAI networks
The frontal method based on mechanics and dynamic programming
Local and global relational consistency
Irrelevance and parameter learning in Bayesian networks
Nonserial dynamic programming formulations of satisfiability
Decentralized decision-making in a large team with local information.
A comparison of graphical techniques for decision analysis
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
Topological parameters for time-space tradeoff
Linear time algorithms for NP-hard problems restricted to partial k- trees
The design of a 0-1 integer optimizer and its application in the Carmen system
Optimal mass production
A logical approach to efficient Max-SAT solving
Optimal resource leveling using non-serial dynamic programming
Partition-based logical reasoning for first-order and propositional theories
Binary join trees for computing marginals in the Shenoy-Shafer architecture
Some tractable instances of interval data minmax regret problems
Characterizing and generalizing cycle completable graphs
Studies on hypergraphs. I: Hyperforests
Nonserial dynamic programming: On the optimal strategy of variable elimination for the rectangular lattice
Tight double exponential lower bounds
Computing rank dependent utility in graphical models for sequential decision problems
A faster tree-decomposition based algorithm for counting linear extensions
Parameterized leaf power recognition via embedding into graph products
On the theory of the elimination process
Efficient approximate linear programming for factored MDPs
On non-serial dynamic programming
Optimal procedures for dynamic programs with complex loop structures
Constraint-based optimization and utility elicitation using the minimax decision criterion
Efficient operation of natural gas transmission systems: a network-based heuristic for cyclic structures
The principle of optimality in the design of efficient algorithms

This page was built for publication: Contribution to nonserial dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2536444)