Search Results - subject:"Loading problem"

A prototype column generation strategy for the multiple container loading problem

Zhu, Wenbin; Huang, Weili; Lim, Andrew - In: European journal of operational research : EJOR 223 (2012) 1, pp. 27-39

Persistent link: https://www.econbiz.de/10009614045

Steiner tree packing revisited

Hoàng, Nam Dũng; Koch, Thorsten - In: Mathematical methods of operations research 76 (2012) 1, pp. 95-123

Persistent link: https://www.econbiz.de/10009571213

Space defragmentation for packing problems

Zhu, Wenbin; Zhang, Zhaoyi; Oon, Wee-chong; Lim, Andrew - In: European journal of operational research : EJOR 222 (2012) 3, pp. 452-463

Persistent link: https://www.econbiz.de/10009575810

A new iterative-doubling Greedy-Lookahead algorithm for the single container loading problem

Zhu, Wenbin; Lim, Andrew - In: European journal of operational research : EJOR 222 (2012) 3, pp. 408-417

Persistent link: https://www.econbiz.de/10009575864

An exact strip packing algorithm based on canonical forms

Arahori, Yohei; Imamichi, Taskashi; Nagamochi, Hiroshi - In: Computers & operations research : and their … 39 (2012) 12, pp. 2991-3011

Persistent link: https://www.econbiz.de/10009576564

A heuristic algorithm for the strip packing problem

Chen, Jianli; Zhu, Wenxing; Peng, Zheng - In: Journal of heuristics 18 (2012) 4, pp. 677-697

Persistent link: https://www.econbiz.de/10009577712

Comparing online algorithms for bin packing problems

Epstein, Leah; Favrholdt, Lene M.; Kohrt, Jens S. - In: Journal of scheduling 15 (2012) 1, pp. 13-21

Persistent link: https://www.econbiz.de/10009522884

Absolute approximation ratios for packing rectangles into bins

Harren, Rolf; Stee, Rob van - In: Journal of scheduling 15 (2012) 1, pp. 63-75

Persistent link: https://www.econbiz.de/10009522888

Solving an one-dimensional cutting stock problem by simulated annealing and tabu search

Jahromi, Meghdad HMA; Tavakkoli-Moghaddam, Reza; Makui, … - In: Journal of industrial engineering international 8 (2012), pp. 1-8

A cutting stock problem is one of the main and classical problems in operations research that is modeled as LP problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms,...

Persistent link: https://www.econbiz.de/10009758828

A simple approach to the two-dimensional guillotine cutting stock problem

Aryanezhad, Mir-Bahador; Hashemi, Nima Fakhim; Makui, Ahmad - In: Journal of industrial engineering international 8 (2012), pp. 1-10

Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a...

Persistent link: https://www.econbiz.de/10009758832