An MDD Approach to Multidimensional Bin Packing

DOI10.1007/978-3-642-38171-3_9zbMath1382.68224OpenAlexW92428347MaRDI QIDQ4922908

Willem-Jan van Hoeve, Brian Kell

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Related Items (8)

An optimization-based heuristic for the machine reassignment problem ⋮ Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Target Cuts from Relaxed Decision Diagrams ⋮ Discrete Optimization with Decision Diagrams ⋮ Compiling CP subproblems to MDDs and d-DNNFs ⋮ 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

This page was built for publication: An MDD Approach to Multidimensional Bin Packing