The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds

4OR ◽  
2003 ◽  
Vol 1 (2) ◽  
Author(s):  
MarcoA. Boschetti ◽  
Aristide Mingozzi
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
Upper Bounds ◽  
Two Dimensional ◽  
Lower And Upper Bounds ◽  
Bin Packing Problem

scholarly journals Lower and upper bounds for the Bin Packing Problem with Fragile Objects

2014 ◽  
Vol 163 ◽  
pp. 73-86 ◽  
Author(s):  
François Clautiaux ◽  
Mauro Dell’Amico ◽  
Manuel Iori ◽  
Ali Khanafer
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
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

scholarly journals A hybrid VNS matheuristic for a bin packing problem with a color constraint

2021 ◽  
pp. 9-9
Author(s):  
Yury Kochetov ◽  
Arteam Kondakov
Keyword(s):  
Column Generation ◽  
Bin Packing ◽  
Packing Problem ◽  
Upper Bounds ◽  
Hard Problem ◽  
Generation Technique ◽  
Bin Packing Problem ◽  
New Variant ◽  
Finite Set ◽  
Np Hard Problem

We study a new variant of the bin packing problem with a color constraint. Given a finite set of items, each item has a set of colors. Each bin has a color capacity, the total number of colors for a bin is the unification of colors for its items and cannot exceed the bin capacity. We need to pack all items into the minimal number of bins. For this NP-hard problem we present approximability results and design a hybrid matheuristic based on the column generation technique. A hybrid VNS heuristic is applied to the pricing problem. The column generation method provides a lower bound and a core subset of the most promising bin patterns. Fast heuristics and exact solution for this core produce upper bounds. Computational experiments for test instances with number of items up to 500 illustrate the efficiency of the approach.

A new exact method for the two-dimensional bin-packing problem with fixed orientation

2007 ◽  
Vol 35 (3) ◽  
pp. 357-364 ◽  
Author(s):  
François Clautiaux ◽  
Jacques Carlier ◽  
Aziz Moukrim
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
Exact Method ◽  
Two Dimensional ◽  
Bin Packing Problem ◽  
Fixed Orientation

scholarly journals Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem

Computing ◽  
1987 ◽  
Vol 39 (3) ◽  
pp. 201-217 ◽  
Author(s):  
J. B. G. Frenk ◽  
G. Galambos
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
Two Dimensional ◽  
Bin Packing Problem
Sign in / Sign up

Export Citation Format

Share Document