Binary decision diagrams for bin packing with minimum color fragmentation

DOI10.1007/978-3-030-19212-9_4OpenAlexW2902648507MaRDI QIDQ2327239

Yanyan Li

Publication date: 14 October 2019

Full work available at URL: https://arxiv.org/abs/1812.00059

zbMATH Keywords

integer programmingbinary decision diagramsbin packing

Mathematics Subject Classification ID

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

Related Items (3)

Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming

This page was built for publication: Binary decision diagrams for bin packing with minimum color fragmentation