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

• 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
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3370201 (Why is no real title available?)
• Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems

Cited in

(22)

• An improvement of Reed's treewidth approximation
• Width, depth, and space: tradeoffs between branching and dynamic programming
• MiniBrass: soft constraints for MiniZinc
• An asymptotic analysis of labeled and unlabeled k-trees
• A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
• An improvement of Reed's treewidth approximation
• Algebras for tree decomposable graphs
• Graph limits of random graphs from a subset of connected k-trees
• Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
• Edge-treewidth: algorithmic and combinatorial properties
• Monoidal Width
• Monoidal Width: Capturing Rank Width
• Twin-treewidth: a single-exponential logic-based approach
• A finite presentation of graphs of treewidth at most three
• Lagrangian dual for integer optimization with zero duality gap that admits decomposition
• Graph parameters, universal obstructions, and WQO
• Learning additive decompositions of multiattribute utility functions
• Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
• A dichotomy theorem for linear time homomorphism orbit counting in bounded degeneracy graphs
• Structure-guided automated reasoning
• Multicut problems in embedded graphs: the dependency of complexity on the demand pattern

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)