Author:
Evtimov Georgi,Fidanova Stefka
Publisher
Springer International Publishing
Reference10 articles.
1. Alvarez-Valdes, R., Parajon, A., Tamarit, J.M.: A computational study of heuristic algorithms for two-dimensional cutting stock problems. In: 4th Metaheuristics International Conference (MIC 2001), pp. 16–20 (2001)
2. Alvarez-Valdes, R., Parreno, F., Tamarit, J.M.: A Tabu Search algorithm for two dimensional non-guillotine cutting problems. Eur. J. Oper. Res. 183(3), 1167–1182 (2007)
3. Cintra, G., Miyazawa, F., Wakabayashi, Y., Xavier, E.: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur. J. Oper. Res. 191, 61–85 (2008)
4. Lecture Notes in Computer Science;F Dusberger,2014
5. Dusberger, F., Raidl, G.R.: Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search. Electron. Notes Discrete Math. 47, 133–140 (2015)