Decision diagrams and dynamic programming
DOI10.1007/978-3-642-38171-3_7zbMATH Open1382.90113OpenAlexW187588655MaRDI QIDQ4922906FDOQ4922906
Authors: John N. Hooker 
Publication date: 4 June 2013
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_7
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Dynamic programming (90C39) Data structures (68P05) Inventory, storage, reservoirs (90B05)
Cited In (21)
- Implementing efficient All solutions SAT solvers
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- Constraint programming and operations research
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- Decomposition based on decision diagrams
- Optimization Bounds from Binary Decision Diagrams
- Title not available (Why is that?)
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- Title not available (Why is that?)
- Network Models for Multiobjective Discrete Optimization
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Stochastic decision diagrams
- Title not available (Why is that?)
- Discrete optimization with decision diagrams
- Decision diagrams for optimization
- On the consistent path problem
- Superset Generation on Decision Diagrams
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Improving the filtering of branch-and-bound MDD solver
- Interactive Cost Configuration Over Decision Diagrams
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
This page was built for publication: Decision diagrams and dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922906)
