On non-serial dynamic programming

DOI10.1016/0097-3165(73)90016-2zbMath0264.49021OpenAlexW2055916047MaRDI QIDQ2561771

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

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

Related Items (13)

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

Cites Work

• Unnamed Item
• Unnamed Item
• A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming
• Contribution to nonserial dynamic programming
• A theorem in nonserial dynamic programming
• Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems
• A note on a paper by Spillers and Hickerson

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