References
- Alvarez-Valdes R, Parreño F and Tamarit JM (2006). Reactive GRASP for the strip-packing problem. Comput Opns Res, Available online 14 August 2006, doi:10.1016/j.cor.2006.07.004.
- BakerBSCoffmanEGRivestRLOrthogonal packings in two dimensionsSIAM J Comput1980984685510.1137/0209064
- Belov G and Scheithauer G (2007). Setup and open stacks minimization in one-dimensional stock cutting. Preprint MATH-NM-16-2003, Dresden University. INFORMS J Comput, 19(1): 27–35.
- BerkeyJOWangPYTwo-dimensional finite bin-packing algorithmsJ Opns Res Soc19873842342910.1057/jors.1987.70
- BortfeldtAA genetic algorithm for the two-dimensional strip packing problem with rectangular piecesEur J Opl Res200617281483710.1016/j.ejor.2004.11.016
- Clautiaux F, Carlier J and Moukrim A (2006). A new exact method for the two-dimensional orthogonal packing problem. Eur J Opl Res, Available online, doi:10.1016/j.ejor.2005.12.048.
- FeketeSPSchepersJA combinatorial characterization of higher-dimensional orthogonal packingMath Opns Res20042935336810.1287/moor.1030.0079
- HartmannSProject Scheduling Under Limited Resources2000
- HealyPCreavinMKuusikAAn optimal algorithm for rectangle placementOpns Res Lett199924738010.1016/S0167-6377(98)00048-0
- Hopper E (2000). Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. PhD thesis, Cardiff University.
- HopperETurtonBCHAn empirical investigation of metaheuristic and heuristic algorithms for a 2D-packing problemEur J Opnl Res2000128345710.1016/S0377-2217(99)00357-4
- IoriMMartelloSMonaciMMetaheuristic algorithms for the strip packing problemOptimizations and Industry: New Frontiers2003
- LeshNMitzenmacherMBubbleSearch: A simple heuristic for improving priority-based greedy algorithmsInform Process Lett20069716116910.1016/j.ipl.2005.08.013
- LeshNMcMahonAMarksJMitzenmacherMExhaustive approaches to 2D rectangular perfect packingsInform Process Lett20049071410.1016/j.ipl.2004.01.006
- LodiAMartelloSVigoDHeuristic and metaheuristic approaches for a class of two-dimensional bin packing problemsINFORMS J Comput19991134535710.1287/ijoc.11.4.345
- LodiAMartelloSVigoDRecent advances on two-dimensional bin packing problemsDiscrete Appl Math200212337939610.1016/S0166-218X(01)00347-X
- MartelloSVigoDExact solution of the finite two-dimensional bin packing problemMngt Sci19984438839910.1287/mnsc.44.3.388
- MartelloSPisingerDTothPDynamic programming and strong bounds for the 0-1 knapsack problemMngt Sci19994541442410.1287/mnsc.45.3.414
- Moler C (2001). Ziggurat algorithm generates normally distributed random numbers. MATLAB News Notes, http://www.mathworks.com.
- Mukhacheva AS and Valeeva AF (2000). Dynamic enumeration for two-dimensional packing. Inform Technol 5:30–37 (in Russian).
- Mukhacheva EA and Mukhacheva AS (2000). Method of reconstruction for rectangular packing. Inform Technol 4:30–36 (in Russian).
- Mukhacheva EA and Mukhacheva AS (2004). Local search methods with block structures in rectangular packing. Automat Telemech 2: 101–112 (in Russian).
- MukhachevaEABelovGNKartakVMMukhachevaASLinear one-dimensional cutting-packing problems: Numerical experiments with sequential value correction method (svc) and a modified branch-and-bound method (mbb)Pesquisa Opnl20002015316810.1590/S0101-74382000000200002
- Murata H, Fujiyoshi K, Nakatake S and Kajitani Y (1995). Rectangle-packing-based module placement. In: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, IEEE Computer Society, pp. 472–479.
- ScheithauerGLP-based bounds for the container and multi-container loading problemInt Trans Opl Res1999619921310.1111/j.1475-3995.1999.tb00151.x