Results 181 to 190 of about 321 (213)

Bin Packing Problem with Conflicts and Item Fragmentation

Computers & Operations Research, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Evolutionary Heuristics for the Bin Packing Problem

1995
In this paper we investigate the use of two evolutionary based heuristic to the bin packing problem. The intractability of this problem is a motivation for the pursuit of heuristics that produce approximate solutions. Unlike other evolutionary based heuristics used with optimization problems, ours do not use domain-specific knowledge and has no ...
Sami Khuri, Martin Schütz, Jörg Heitkötter   +2 more
openaire   +1 more source

Two-Dimensional Bin Packing Problems

2010
An important variant of two-dimensional bin packing problem (2BP), which is also used in some approximation algorithms for its solution, is the strip packing problem (2SP), in which the items have to be packed in a strip of width W and infinite height, so as to minimize the height at which the strip is used.
LODI, ANDREA, MARTELLO, SILVANO, MONACI, MICHELE, VIGO, DANIELE   +3 more
openaire   +2 more sources

Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem

European Journal of Operational Research, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marc Peeters, Zeger Degraeve
openaire   +1 more source

A goal-driven approach to the 2D bin packing and variable-sized bin packing problems

European Journal of Operational Research, 2013
Abstract In this paper, we examine the two-dimensional variable-sized bin packing problem (2DVSBPP), where the task is to pack all given rectangles into bins of various sizes such that the total area of the used bins is minimized. We partition the search space of the 2DVSBPP into sets and impose an order on the sets, and then use a goal-driven ...
Lijun Wei, Wee-Chong Oon, Wenbin Zhu, Andrew Lim 0001   +3 more
openaire   +2 more sources

Heuristic Solution of Open Bin Packing Problems

Journal of Heuristics, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Characterizing the optimality gap and the optimal packings for the bin packing problem

Optimization Letters, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Samir Elhedhli, Fatma Gzara
openaire   +1 more source

Open-End Bin Packing Problem with Conflicts

Computers & Industrial Engineering
In this paper, we study the Open-End Bin Packing Problem with Conflicts (OEBPPC), which is a combination of two variants of the well-known bin packing problem: Open-End Bin Packing Problem and Bin Packing Problem with Conflicts. In OEBPPC, the aim is to place a set of items into the least number of fixed-sized bins.
Ece Nur Balık, Ali Ekici, Milad Elyasi, Okan Örsan Özener   +3 more
openaire   +1 more source

Bin-packing problem [PDF]

, 2016
Opisani su i analizirani osnovni egzaktni, heuristički i aproksimativni algoritmi za Bin-packing problem u jednoj i dvije dimenzije. Za Bin-packing problem u tri dimenzije dan je kratak pregled algoritama koji se koriste. Implementirana je programska podrška za rješavanje 1D i 2D problema opisanim algoritmima.
openaire  

On a Constrained Bin-packing Problem

1995
We study a bin-packing problem which is one-dimensional and is constrained in the manner items are placed into bins. The problem is motivated by a practical real-time scheduling problem, where redundant periodic tasks need to be assigned to a multiprocessor system.
openaire   +1 more source