References
- DyckhoffHA typology of cutting and packing problemsEur J Opl Res19904414515910.1016/0377-2217(90)90350-K
- MartelloSTothPKnapsack Problems, Algorithms and Computer Implementations1990
- HaesslerRWSweeneyPECutting stock problems and solution proceduresEur Journal Opl Res19915414115010.1016/0377-2217(91)90293-5
- FalkenauerEA hybrid grouping genetic algorithm for bin packingJ Heuristics1996253010.1007/BF00226291
- HinterdingRKhanLGenetic algorithms for cutting stock problems: with and without contiguityProgress in Evolutionary Computation1995166186
- ReevesCHybrid genetic algorithms for bin-packing and related problemsAnn Oper Res19966337139610.1007/BF02125404
- Vink M (1997). Solving combinatorial problems using evolutionary algorithms. Available from http://citeseer.nj.nec.com/vink97solvinghtml.
- LiangK-HYaoXNewtonCHoffmanDA new evolutionary approach to cutting stock problems with and without contiguityComput Oper Res2002291641165910.1016/S0305-0548(01)00039-9
- DorigoMManiezzoVColorniAThe ant system: Optimization by a colony of cooperating agentsIEEE T Syst Man Cy B199626294110.1109/3477.484436
- BonabeauEDorigoMTheraulezGSwarm Intelligence: From Natural to Artificial Intelligence1999
- DorigoMStützleTThe ant colony optimization metaheuristic: algorithms, applications, and advancesHandbook of Metaheuristics2002251285
- BilchevGEvolutionary metaphors for the bin packing problemEvolutionary Programming V: Proceedings of the Fifth Annual Conference on Evolutionary Programming1996333341
- BischoffEEWäscherGCutting and packingEur J Opl Res19958450350510.1016/0377-2217(95)00018-L
- CoffmanEGGareyMRJohnsonDSApproximation algorithms for bin packing: a surveyApproximation Algorithms for NP-Hard Problems19964693
- GilmorePCGomoryREA linear programming approach to the cutting stock problemOper Res1961984885910.1287/opre.9.6.849
- WinstonWLOperations Research: Applications and Algorithms1993
- FalkenauerEDelchambreAA genetic algorithm for bin packing and line balancingProceedings of the IEEE 1992 International Conference on Robotics and Automation199211861192
- DorigoMGambardellaLAnt colony system: a cooperative learning approach to the travelling salesman problemIEEE T Evolut Comput19971536610.1109/4235.585892
- StützleTHoosHMAX-MIN ant systemFuture Gener Comp Sys20001688991410.1016/S0167-739X(00)00043-1
- Maniezzo V, Colorni A and Dorigo M (1994). The ant system applied to the quadratic assignment problem. Technical Report, IRIDIA, Universit é Libre de Bruxelles, Brussels, Belgium.
- GambardellaLTaillardEDorigoMAnt colonies for the quadratic assignment problemJ Opl Res Soc19995016717610.1057/palgrave.jors.2600676
- BauerABullnheimerBHartlRStraussCAn ant colony optimization approach for the single machine total tardiness problemProceedings of the 1999 Congress on Evolutionary Computation199914451450
- StützleTAn ant approach to the flow shop problemProceedings of the 6th European Congress on Intelligent Techniques and Soft Computing199815601564
- GambardellaLTaillardEAgazziGMACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windowsNew Ideas in Optimization19996376
- CostaDHertzAAnts can colour graphsJ Opl Res Soc19974829530510.1057/palgrave.jors.2600357
- MichelRMiddendorfMAn ACO algorithm for the shortest supersequence problemNew Ideas in Optimization19995161
- LeguizamonGMichalewiczZA new version of ant system for subset problemsProceedings of the 1999 Congress of Evolutionary Computation199914591464
- Alvim A, Glover F, Ribeiro C and Aloise D (1999). Local search for the bin packing problem. Available from http://citeseer.nj.nec.com/alvim99local.html.
- SchollAKleinRJürgensCBISON: a fast procedure for exactly solving the one-dimensional bin packing problemComput Oper Res19972462764510.1016/S0305-0548(96)00082-2
- GentIHeuristic solution of open bin packing problemsJ Heuristics1997329930410.1023/A:1009678411503
- Alvim A, Glover F, Ribeiro C and Aloise D (2002). A hybrid improvement heuristic for the bin packing problem. Available from http://citeseer.nj.nec.com/557429.html.
- FleszarKHindiKNew heuristics for one-dimensional bin-packingComput Oper Res20022982183910.1016/S0305-0548(00)00082-4