Pages that link to "Item:Q2011572"
From MaRDI portal
The following pages link to On finding the optimal BDD relaxation (Q2011572):
Displaying 4 items.
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (Q2026989) (← links)
- Improving the filtering of branch-and-bound MDD solver (Q2117223) (← links)
- Graph coloring with decision diagrams (Q2118148) (← links)
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421) (← links)
