Decision diagrams and dynamic programming
From MaRDI portal
Publication:4922906
Recommendations
Cited in
(21)- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- 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
- scientific article; zbMATH DE number 1424030 (Why is no real title available?)
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- scientific article; zbMATH DE number 1423224 (Why is no real title available?)
- Network Models for Multiobjective Discrete Optimization
- Stochastic decision diagrams
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- scientific article; zbMATH DE number 569736 (Why is no real title available?)
- Decision diagrams for optimization
- Discrete optimization with decision diagrams
- 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
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)