Search Results - subject:"Bin Packing Problem"

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

Kouakou, Bernard; Demange, Marc; Soutif, Eric - HAL - 2006

In this paper, we study the on-line version of the bin-packing problem. We analyze the approximation behavior of an on … difficulty of the problem and for the quality of the algorithm developed to solve it. In its off-line version, the bin-packing … problem, BP, is better approximated in differential framework than in standard one. Our objective is to determine if or not …

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

On the Sum-of-Squares Algorithm for Bin Packing

Csirik, Janos - 2006

In this paper we present a theoretical analysis of the on-line Sum-of-Squares algorithm (SS) for bin packing along with several new variants. SS is applicable to any instance of bin packing in which the bin capacity B and item sizes s(a) are integral (or can be scaled to be so), and runs in time...

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

Parallel greedy algorithms for packing unequal circles into a strip or a rectangle

Kubach, Timo - 2006

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

C & P software for a cutting problem of a German wood panel manufacturer : a case study

Papke, Tracy - 2006

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

Efficient algorithms for the offline variable sized bin-packing problem

Maiza, Mohamed; Labed, Abdenour; Radjef, Mohammed - In: Journal of Global Optimization 57 (2013) 3, pp. 1025-1038

We addresses a variant of the classical one dimensional bin-packing problem where several types of bins with unequal …

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

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

This paper uses a knowledge discovery method, Principal Component Analysis (PCA), to gain a deeper understanding of the structure of bin packing problems and how this relates to the performance of heuristic approaches to solve them. The study considers six heuristics and their combination...

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

Optimizing fire station locations for the Istanbul Metropolitan Municipality

Aktaş, Emel; Özaydın, Özay; Bozkaya, Burçin; … - In: Interfaces : the INFORMS journal on the practice of … 43 (2013) 3, pp. 240-255

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

Models for the two-dimensional two-stage cutting stock problem with multiple stock size

Furini, Fabio; Malaguti, Enrico - In: Computers & operations research : and their … 40 (2013) 8, pp. 1953-1962

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

Semi-on-line bin packing : a short overview and a new lower bound

Balogh, János; Békési, József - In: Central European journal of operations research : CEJOR … 21 (2013) 4, pp. 685-698

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

Exact algorithms for a bandwidth packing problem with queueing delay guarantees

Han, Jinil; Lee, Kyungsik; Lee, Chungmok; Park, Sungsoo - In: INFORMS journal on computing : JOC 25 (2013) 3, pp. 585-596

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