Author:
Evtimov Georgi,Fidanova Stefka
Publisher
Springer International Publishing
Reference8 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 (MIC2001), 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. Dusberger, F., Raidl, G.R.: A variable neighborhood search using very large neighborhood structures for the 3-staged 2-dimensional cutting stock problem. In: Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 8457, pp. 85–99. Springer (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 Discret. Math. 47, 133–140 (2015)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献