@inproceedings{1475e977cb61405a872582564a3701ff,
title = "A heuristic for the multiple container loading cost minimization problem",
abstract = "We examine the multiple container loading cost minimization problem (MCLCMP), where the objective is to load products of various types into containers of various sizes so as to minimize the total container cost. We transform the MCLCMP into an extended set cover problem that is formulated using linear integer programming and solve it with a heuristic to generate columns. Experiments on standard bin-packing instances show our approach is superior to prior approaches. {\textcopyright} 2011 Springer-Verlag.",
keywords = "Container Loading, Heuristics, Integer Programming, Packing",
author = "Che, \{Chan Hou\} and Weili Huang and Andrew Lim and Wenbin Zhu",
year = "2011",
doi = "10.1007/978-3-642-21827-9\_28",
language = "English",
isbn = "9783642218262",
volume = "6704 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "276--285",
booktitle = "Modern Approaches in Applied Intelligence",
address = "Germany",
edition = "PART 2",
note = "24th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2011 ; Conference date: 28-06-2011 Through 01-07-2011",
}