Nonserial dynamic programming

zbMath0244.49007MaRDI QIDQ2554881

U. Bertele, Francesco Brioschi

Publication date: 1972

Published in: Mathematics in Science and Engineering (Search for Journal in Brave)

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Hamilton-Jacobi theories (49L99)

Related Items

Tractability in constraint satisfaction problems: a survey ⋮ A new approach on locally checkable problems ⋮ Parameterized Complexity of Fair Feedback Vertex Set Problem ⋮ A polynomial time algorithm to compute the connected treewidth of a series-parallel graph ⋮ Adapting the directed grid theorem into an \textsf{FPT} algorithm ⋮ Mixed deterministic and probabilistic networks ⋮ Tractability-preserving transformations of global cost functions ⋮ Computational social choice for coordination in agent networks ⋮ Systolic processing for dynamic programming problems ⋮ An algorithm for large scale 0-1 integer programming with application to airline crew scheduling ⋮ Constraint relaxation may be perfect ⋮ Probability propagation ⋮ Network-based heuristics for constraint-satisfaction problems ⋮ Graphical Models and Message-Passing Algorithms: Some Introductory Lectures ⋮ Graph decompositions and tree automata in reasoning with uncertainty ⋮ Cluster analysis and mathematical programming ⋮ Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects ⋮ Tree clustering for constraint networks ⋮ Symmetric approximate linear programming for factored MDPs with application to constrained problems ⋮ Stochastic decision diagrams ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ Parameterized complexity of fair feedback vertex set problem ⋮ Parameterized complexity of fair deletion problems ⋮ On the thinness and proper thinness of a graph ⋮ Steepest ascent can be exponential in bounded treewidth problems ⋮ Decomposability helps for deciding logics of knowledge and belief ⋮ Adapting the Directed Grid Theorem into an FPT Algorithm ⋮ Metropolized Knockoff Sampling ⋮ A general framework for enumerating equivalence classes of solutions ⋮ Spined categories: generalizing tree-width beyond graphs ⋮ Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ On strict brambles ⋮ Locating Eigenvalues of Symmetric Matrices - A Survey ⋮ Unnamed Item ⋮ Models of the optimal resource allocation for the critical infrastructure protection ⋮ Unnamed Item ⋮ The General Minimum Fill-In Problem ⋮ Cost Propagation – Numerical Propagation for Optimization Problems ⋮ Solving Graph Problems via Potential Maximal Cliques ⋮ Bundled Crossings Revisited ⋮ Temporal constraint networks ⋮ LP Formulations for Polynomial Optimization Problems ⋮ Parameterized Leaf Power Recognition via Embedding into Graph Products ⋮ A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions ⋮ Finding a given number of solutions to a system of fuzzy constraints ⋮ Compatibility, desirability, and the running intersection property ⋮ Weighted heuristic anytime search: new schemes for optimization over graphical models ⋮ Properties of graphs specified by a regular language ⋮ The many-commodity location problem (the branch-and-bound method) ⋮ Optimal periodic control strategies in a dynamic pricing problem† ⋮ A logic of soft constraints based on partially ordered preferences ⋮ Bucket elimination for multiobjective optimization problems ⋮ Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality ⋮ Constructing tree decompositions of graphs with bounded gonality ⋮ Constructing tree decompositions of graphs with bounded gonality ⋮ Complete-subgraph-transversal-sets problem on bounded treewidth graphs ⋮ Sufficient and necessary conditions for solution finding in valuation-based systems ⋮ A Tractable Class of Binary VCSPs via M-Convex Intersection ⋮ Perspectives on the theory and practice of belief functions ⋮ Bidimensionality and Kernels ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited ⋮ Diffusion methods for classification with pairwise relationships ⋮ Status of periodic optimization of dynamical systems ⋮ Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs ⋮ A Comprehensive Model of Dynamic Programming ⋮ Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey ⋮ The treewidth of 2-section of hypergraphs ⋮ The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side ⋮ Compositional models in valuation-based systems ⋮ High-order consistency in valued constraint satisfaction