Search Results - subject:"Bin Packing"

Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints

Queiroz, Thiago A. de; Miyazawa, Flávio K. - In: International journal of production economics 145 (2013) 2, pp. 511-530

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

Understanding the structure of bin packing problems through principal component analysis

López-Camacho, Eunice; Terashima-Marín, Hugo; Ochoa, … - In: International journal of production economics 145 (2013) 2, pp. 488-499

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

The Dotted-Board Model : a new MIP model for nesting irregular shapes

Toledo, Franklina Maria Bragion de; Carravilla, Maria … - In: International journal of production economics 145 (2013) 2, pp. 478-487

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

A branch & bound algorithm for cutting and packing irregularly shaped pieces

Alvarez-Valdes, Ramon; Martinez, A.; Tamarit, J. M. - In: International journal of production economics 145 (2013) 2, pp. 463-477

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

An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem

Russo, Mauro; Sforza, Antonio; Sterle, Claudio - In: International journal of production economics 145 (2013) 2, pp. 451-462

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

Special section: Cutting and packing

Bennell, Julia A. (contributor) - In: International journal of production economics 145 (2013) 2, pp. 449-572

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

Packing and covering with linear programming : a survey

Bentz, Cédric; Cornaz, Denis; Ries, Bernard - In: European journal of operational research : EJOR 227 (2013) 3, pp. 409-422

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

Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints

Han, Wei; Bennell, Julia A.; Zhao, Xiaozhou; Song, Xiang - In: European journal of operational research : EJOR 230 (2013) 3, pp. 495-504

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

On-line bin-packing problem : maximizing the number of unused bins.

Kouakou, Bernard; Demange, Marc; Soutif, Eric - Maison des Sciences Économiques, Université Paris 1 … - 2005

In this paper, we study the on-line version of the bin-packing problem. We analyze the approximation behaviour of an on …-line bin-packing algorithm under an approximation criterion called differential ratio. We are interested in two types of … difficulty of the problem and for the quality of the algorithm developed to solve it. In its off-line version, the bin-packing …

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

A Comprehensive and Robust Procedure for Obtaining the Nofit Polygon Using Monkowski Sums

Bennell, Julia A.; Song, Xiang - 2005

The nofit polygon is a powerful and effective tool for handling the geometric requirements of solution approaches to irregular cutting and packing problems. Although the concept was first described in 1996, it was not until the early 90s that the general trend of research moved away from direct...

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