Contribution to nonserial dynamic programming
From MaRDI portal
Publication:2536444
DOI10.1016/0022-247X(69)90030-4zbMath0187.17801MaRDI QIDQ2536444
Francesco Brioschi, U. Bertele
Publication date: 1969
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems, Topological parameters for time-space tradeoff, Some tractable instances of interval data minmax regret problems, The principle of optimality in the design of efficient algorithms, Nonserial dynamic programming formulations of satisfiability, Linear time algorithms for NP-hard problems restricted to partial k- trees, Optimal mass production, Studies on hypergraphs. I: Hyperforests, The frontal method based on mechanics and dynamic programming, A comparison of graphical techniques for decision analysis, Optimal resource leveling using non-serial dynamic programming, The design of a 0-1 integer optimizer and its application in the Carmen system, Irrelevance and parameter learning in Bayesian networks, Local and global relational consistency, Decentralized decision-making in a large team with local information., Binary join trees for computing marginals in the Shenoy-Shafer architecture, Optimal procedures for dynamic programs with complex loop structures, Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering, Constraint-based optimization and utility elicitation using the minimax decision criterion, Partition-based logical reasoning for first-order and propositional theories, Efficient operation of natural gas transmission systems: a network-based heuristic for cyclic structures, A theorem in nonserial dynamic programming, Nonserial dynamic programming: On the optimal strategy of variable elimination for the rectangular lattice, On the theory of the elimination process, On non-serial dynamic programming
Cites Work
