Narrow search
Showing 161 - 170 of 31,073
Cover Image
A multi-scenario model for empty container repositioning with uncertain demand
Di Francesco, Massimo; Lai, Michela; Zuddas, Paola - In: International journal of services and operations management 19 (2014) 2, pp. 212-228
Persistent link: https://www.econbiz.de/10011281703
Cover Image
An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
Lu, Hao-Chun; Huang, Yao-Huei - In: European journal of operational research : EJOR 246 (2015) 1, pp. 51-66
Persistent link: https://www.econbiz.de/10011341190
Cover Image
Models and algorithms for packing rectangles into the smallest square
Martello, Silvano; Monaci, Michele - In: Computers & operations research : and their … 63 (2015), pp. 161-171
Persistent link: https://www.econbiz.de/10011344139
Cover Image
An efficient local search heuristic with row weighting for the unicost set covering problem
Gao, Chao; Yao, Xin; Weise, Thomas; Li, Jinlong - In: European journal of operational research : EJOR 246 (2015) 3, pp. 750-761
Persistent link: https://www.econbiz.de/10011344484
Cover Image
A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
Serairi, Mehdi; Haouari, Mohamed - In: RAIRO / Operations research 52 (2018) 2, pp. 391-414
Persistent link: https://www.econbiz.de/10011987060
Cover Image
Lower bounds for a bin packing problem with linear usage cost
Braune, Roland - In: European journal of operational research : EJOR 274 (2019) 1, pp. 49-64
Persistent link: https://www.econbiz.de/10011989974
Cover Image
Combined cutting stock and lot-sizing problem with pattern setup
Ma, Ning; Liu, Ya; Zhou, Zhili; Chu, Chengbin - In: Computers & operations research : and their … 95 (2018), pp. 44-55
Persistent link: https://www.econbiz.de/10011866575
Cover Image
A beam search approach to solve the convex irregular bin packing problem with guillotine cuts
Bennell, J.A.; Cabo, M.; Martínez-Sykora, Antonio - In: European journal of operational research : EJOR 270 (2018) 1, pp. 89-102
Persistent link: https://www.econbiz.de/10011868935
Cover Image
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
Wei, Lijun; Hu, Qian; Lim, Andrew; Liu, Qiang - In: European journal of operational research : EJOR 270 (2018) 2, pp. 448-474
Persistent link: https://www.econbiz.de/10011869044
Cover Image
Classification and literature review of integrated lot-sizing and cutting stock problems
Melega, Gislaine Mara; Araujo, Silvio de; Jans, Raf - In: European journal of operational research : EJOR 271 (2018) 1, pp. 1-19
Persistent link: https://www.econbiz.de/10011882759