Stochastic decision diagrams

DOI10.1007/978-3-031-08011-1_11zbMath1504.90079OpenAlexW4285277733MaRDI QIDQ2170193

John N. Hooker

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_11

zbMATH Keywords

stochastic dynamic programmingmaximum clique problemrelaxed decision diagramsstochastic decision diagrams

Mathematics Subject Classification ID

Stochastic programming (90C15) Dynamic programming (90C39) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decision diagrams for optimization
• Incorporating bounds from decision diagrams into integer programming
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
• Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
• Nonserial dynamic programming
• BDD-based optimization for the quadratic stable set problem
• Discrete Optimization with Decision Diagrams
• New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
• Optimization Bounds from Binary Decision Diagrams
• Manipulating MDD Relaxations for Combinatorial Optimization
• Approximate Dynamic Programming
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Cost-Bounded Binary Decision Diagrams for 0-1 Programming
• State-space relaxation procedures for the computation of bounds to routing problems
• Decision Diagrams and Dynamic Programming
• Multivalued Decision Diagrams for Sequencing Problems
• The theory of dynamic programming

This page was built for publication: Stochastic decision diagrams