A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case

2014 ◽  
Author(s):  
Mariem Baazaoui ◽  
Said Hanafi ◽  
Hichem Kamoun
Keyword(s):  
Lower Bound ◽  
Bin Packing ◽  
Mathematical Formulation ◽  
Three Dimensional ◽  
Packing Problem ◽  
Bin Packing Problem

scholarly journals Heuristics Algorithms Based on a Linear Programming for the Three-Dimensional Bin-Packing Problem

2010 ◽  
Vol 43 (8) ◽  
pp. 72-76 ◽  
Author(s):  
Mhand Hifi ◽  
Imed Kacem ◽  
Stephane Negre ◽  
Lei Wu
Keyword(s):  
Linear Programming ◽  
Bin Packing ◽  
Three Dimensional ◽  
Packing Problem ◽  
Bin Packing Problem

A new lower bound for the non-oriented two-dimensional bin-packing problem

2007 ◽  
Vol 35 (3) ◽  
pp. 365-373 ◽  
Author(s):  
François Clautiaux ◽  
Antoine Jouglet ◽  
Joseph El Hayek
Keyword(s):  
Lower Bound ◽  
Bin Packing ◽  
Packing Problem ◽  
Two Dimensional ◽  
Bin Packing Problem

Guided Local Search for the Three-Dimensional Bin-Packing Problem

2003 ◽  
Vol 15 (3) ◽  
pp. 267-283 ◽  
Author(s):  
Oluf Faroe ◽  
David Pisinger ◽  
Martin Zachariasen
Keyword(s):  
Local Search ◽  
Bin Packing ◽  
Three Dimensional ◽  
Packing Problem ◽  
Guided Local Search ◽  
Bin Packing Problem

Heuristic algorithms for the three-dimensional bin packing problem

2002 ◽  
Vol 141 (2) ◽  
pp. 410-420 ◽  
Author(s):  
Andrea Lodi ◽  
Silvano Martello ◽  
Daniele Vigo
Keyword(s):  
Bin Packing ◽  
Heuristic Algorithms ◽  
Three Dimensional ◽  
Packing Problem ◽  
Bin Packing Problem

TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING

2013 ◽  
Vol 24 (08) ◽  
pp. 1299-1327 ◽  
Author(s):  
ROLF HARREN ◽  
KLAUS JANSEN ◽  
LARS PRÄDEL ◽  
ULRICH M. SCHWARZ ◽  
ROB VAN STEE
Keyword(s):  
Lower Bound ◽  
Knapsack Problem ◽  
Bin Packing ◽  
Packing Problem ◽  
Approximate Algorithm ◽  
Two Dimensional ◽  
Chip Design ◽  
Practical Applications ◽  
Vlsi Chip ◽  
Bin Packing Problem

In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of unit bins without rotating the rectangles. Beyond its theoretical appeal, this problem has many practical applications, for example in print layout and VLSI chip design. We present a 2-approximate algorithm, which improves over the previous best known ratio of 3, matches the best results for the problem where rotations are allowed and also matches the known lower bound of approximability. Our approach makes strong use of a PTAS for a related 2D knapsack problem and a new algorithm that can pack instances into two bins if OPT = 1.

scholarly journals Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems

2005 ◽  
Vol 53 (4) ◽  
pp. 735-736 ◽  
Author(s):  
Edgar den Boef ◽  
Jan Korst ◽  
Silvano Martello ◽  
David Pisinger ◽  
Daniele Vigo
Keyword(s):  
Bin Packing ◽  
Three Dimensional ◽  
Packing Problem ◽  
Packing Problems ◽  
Bin Packing Problem

Optimization of a robot-served cart capacity using the three-dimensional single bin packing problem

2014 ◽  
Vol 74 (1) ◽  
pp. 185-198
Author(s):  
A-Ra Khil ◽  
Kang-Hee Lee
Keyword(s):  
Bin Packing ◽  
Three Dimensional ◽  
Packing Problem ◽  
Bin Packing Problem
Sign in / Sign up

Export Citation Format

Share Document