Stochastic decision diagrams

DOI10.1007/978-3-031-08011-1_11MaRDI QIDQ2170193zbMATH OpenOpenAlexFDO

Authors 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

maximum clique problemrelaxed decision diagramsstochastic decision diagramsstochastic dynamic programming

Mathematics Subject Classification ID

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

Recommendations

• Discrete optimization with decision diagrams
• Decision diagrams and dynamic programming
• Optimization Bounds from Binary Decision Diagrams
• A local search framework for compiling relaxed decision diagrams
• Data representation and efficient solution: a decision diagram approach

Cites work

• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
• Approximate dynamic programming. Solving the curses of dimensionality
• BDD-based optimization for the quadratic stable set problem
• Cost-Bounded Binary Decision Diagrams for 0-1 Programming
• Decision diagrams and dynamic programming
• Decision diagrams for optimization
• Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
• Discrete optimization with decision diagrams
• Dynamic programming and optimal control. Vol. 1.
• Dynamic programming and optimal control. Vol. 2
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 2086966 (Why is no real title available?)
• 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
• Manipulating MDD relaxations for combinatorial optimization
• Multivalued decision diagrams for sequencing problems
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• New state-space relaxations for solving the traveling salesman problem with time windows
• Nonserial dynamic programming
• Optimization Bounds from Binary Decision Diagrams
• State-space relaxation procedures for the computation of bounds to routing problems
• The theory of dynamic programming

Cited in

(5)

• A local search framework for compiling relaxed decision diagrams
• \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
• Discrete optimization with decision diagrams
• scientific article; zbMATH DE number 5713166 (Why is no real title available?)
• Decision diagrams and dynamic programming

This page was built for publication: Stochastic decision diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170193)