Nonserial dynamic programming
From MaRDI portal
Cited in
(84)- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Systolic processing for dynamic programming problems
- Network-based heuristics for constraint-satisfaction problems
- Tree clustering for constraint networks
- Temporal constraint networks
- Probability propagation
- Cluster analysis and mathematical programming
- Models of the optimal resource allocation for the critical infrastructure protection
- Finding a given number of solutions to a system of fuzzy constraints
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- Compatibility, desirability, and the running intersection property
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs
- A new approach on locally checkable problems
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- Stochastic decision diagrams
- Steepest ascent can be exponential in bounded treewidth problems
- Sufficient and necessary conditions for solution finding in valuation-based systems
- Compositional models in valuation-based systems
- Constraint relaxation may be perfect
- On the thinness and proper thinness of a graph
- A logic of soft constraints based on partially ordered preferences
- Bucket elimination for multiobjective optimization problems
- Status of periodic optimization of dynamical systems
- Parameterized complexity of fair feedback vertex set problem
- On strict brambles
- Tractability in constraint satisfaction problems: a survey
- Tractability-preserving transformations of global cost functions
- Computational social choice for coordination in agent networks
- Optimizing epistemic model checking using conditional independence (extended abstract)
- Bidimensionality and kernels
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- A Comprehensive Model of Dynamic Programming
- The General Minimum Fill-In Problem
- Optimal periodic control strategies in a dynamic pricing problem†
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- Graph decompositions and tree automata in reasoning with uncertainty
- Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- LP formulations for polynomial optimization problems
- A tractable class of binary VCSPs via M-convex intersection
- A faster tree-decomposition based algorithm for counting linear extensions
- Parameterized leaf power recognition via embedding into graph products
- Randomly coloring graphs of logarithmically bounded pathwidth
- The treewidth of 2-section of hypergraphs
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side
- Parameterized Complexity of Fair Feedback Vertex Set Problem
- Properties of large 2-crossing-critical graphs
- Decomposability helps for deciding logics of knowledge and belief
- Adapting the directed grid theorem into an FPT algorithm
- Weighted heuristic anytime search: new schemes for optimization over graphical models
- Bundled crossings revisited
- The many-commodity location problem (the branch-and-bound method)
- 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
- Cost Propagation – Numerical Propagation for Optimization Problems
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- Constructing tree decompositions of graphs with bounded gonality
- Constructing tree decompositions of graphs with bounded gonality
- Properties of graphs specified by a regular language
- Metropolized Knockoff Sampling
- Spined categories: generalizing tree-width beyond graphs
- Solving infinite-domain CSPs using the patchwork property
- Locating Eigenvalues of Symmetric Matrices - A Survey
- An improved parameterized algorithm for treewidth
- Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
- Excluding a clique or a biclique in graphs of bounded induced matching treewidth
- Grid minors and products
- Approximation algorithms for treewidth, pathwidth, and treedepth -- a short survey
- Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
- Any-k algorithms for enumerating ranked answers to conjunctive queries
- Algorithms and complexity of difference logic
- Tree decompositions meet induced matchings: beyond max weight independent set
- An overview of universal obstructions for graph parameters
- Clustered independence and bounded treewidth
- Tree decompositions meet induced matchings: beyond max weight independent set
- A WSPD, separator and small tree cover for c-packed graphs
- Fast Gaussian elimination for low treewidth matrices
- Induced matching treewidth and tree-independence number, revisited
- Perspectives on the theory and practice of belief functions
- High-order consistency in valued constraint satisfaction
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- Mixed deterministic and probabilistic networks
- Symmetric approximate linear programming for factored MDPs with application to constrained problems
This page was built for publication: Nonserial dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2554881)
