Binary decision diagrams for bin packing with minimum color fragmentation

DOI10.1007/978-3-030-19212-9_4MaRDI QIDQ2327239zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 14 October 2019

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

zbMATH Keywords

integer programmingbin packingbinary decision diagrams

Mathematics Subject Classification ID

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

Recommendations

• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
• Column generation for the variable cost and size bin packing problem with fragmentation
• New formulations for variable cost and size bin packing problems with item fragmentation
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Bin packing with restricted item fragmentation

Cited in

(3)

• 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
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2327239)