On non-serial dynamic programming

DOI10.1016/0097-3165(73)90016-2MaRDI QIDQ2561771zbMATH OpenOpenAlexFDO

Authors U. Bertele, Francesco Brioschi

Publication date 1973

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(73)90016-2

Mathematics Subject Classification ID

Hamilton-Jacobi theories (49L99) Mathematical programming (90C99)

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3370201 (Why is no real title available?)
• A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming
• A note on a paper by Spillers and Hickerson
• A theorem in nonserial dynamic programming
• Contribution to nonserial dynamic programming
• Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems

Cited in

(14)

• A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
• Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
• MiniBrass: soft constraints for MiniZinc
• Monoidal Width: Capturing Rank Width
• Width, depth, and space: tradeoffs between branching and dynamic programming
• Monoidal Width
• Algebras for tree decomposable graphs
• An asymptotic analysis of labeled and unlabeled k-trees
• Twin-treewidth: a single-exponential logic-based approach
• Edge-treewidth: algorithmic and combinatorial properties
• An improvement of Reed's treewidth approximation
• An improvement of Reed's treewidth approximation
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
• Graph limits of random graphs from a subset of connected \(k\)-trees

This page was built for publication: On non-serial dynamic programming

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