References
- FayardDZissimopoulosVAn approximation algorithm for solving unconstrained two-dimensional knapsack problemsEur J Opl Res19958461863210.1016/0377-2217(93)E0221-I
- HifiMOuafiRBest-first search and dynamic programming methods for cutting problems: the cases of one or more stock platesComput Ind Eng19973218720510.1016/S0360-8352(96)00215-X
- BeasleyJEAn algorithm for the two-dimensional assortment problemEur J Opl Res19851925326110.1016/0377-2217(85)90179-1
- LiuFHHsiaoCJA three-dimensional pallet loading method for single-size boxesJ Opl Res Soc19974872673510.1057/palgrave.jors.2600426
- TernoJScheithauerGSommerweiBURiehmeJAn efficient approach for the multi-pallet loading problemEur J Opl Res200012337238110.1016/S0377-2217(99)00263-5
- ScheithauerGLP-based bounds for the container and multi-container loading problemInt Trans Oper Res1999619921310.1111/j.1475-3995.1999.tb00151.x
- DowslandWBThree-dimensional packing-solution approaches and heuristic developmentInt J Prod Res1991291673168510.1080/00207549108948039
- MartelloSPisingerDVigoDThe three-dimensional bin packing problemOper Res20004825626710.1287/opre.48.2.256.12386
- FainaLA global optimization algorithm for the three-dimensional packing problemEur J Opl Res200012634035410.1016/S0377-2217(99)00292-1
- PisingerDHeuristics for the container loading problemEur J Opl Res200214138239210.1016/S0377-2217(02)00132-7
- ChenCSLeeSMShenQSAn analytical model for the container loading problemEur J Opl Res199580687610.1016/0377-2217(94)00002-T
- LiHLChangCTAn approximately global optimization method for assortment problemsEurJ Opl Res199810560461210.1016/S0377-2217(97)00072-6
- SchragaLOptimization modeling with LINGO1998