An MDD approach to multidimensional bin packing
DOI10.1007/978-3-642-38171-3_9zbMATH Open1382.68224OpenAlexW92428347MaRDI QIDQ4922908FDOQ4922908
Authors: Brian Kell, Willem-Jan van Hoeve
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: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.3797
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Data structures (68P05)
Cited In (9)
- Improving branch-and-bound using decision diagrams and reinforcement learning
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- Target cuts from relaxed decision diagrams
- Multivalued decision diagrams for sequencing problems
- An optimization-based heuristic for the machine reassignment problem
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Discrete optimization with decision diagrams
- Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
- Compiling CP subproblems to MDDs and d-DNNFs
This page was built for publication: An MDD approach to multidimensional bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922908)