Results 171 to 180 of about 321 (213)

The Three-Dimensional Bin Packing Problem

Operations Research, 2000
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is strongly NP-hard and extremely difficult to solve in practice. Lower bounds are discussed, and it is proved that the asymptotic worst-case performance ratio of the ...
Martello S., Pisinger D., Vigo D.
openaire   +2 more sources

Cardinality constrained bin‐packing problems

Annals of Operations Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans Kellerer, Ulrich Pferschy
openaire   +1 more source

On the Online Bin Packing Problem

Journal of the ACM, 2001
A new framework for analyzing online bin packing algorithms is presented. This framework presents a unified way of explaining the performance of algorithms based on the Harmonic approach. Within this framework, it is shown that a new algorithm, Harmonic++, has asymptotic performance ratio at most 1.58889.
openaire   +1 more source

Large proper gaps in bin packing and dual bin packing problems

Journal of Global Optimization, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vadim M. Kartak, Artem V. Ripatti
openaire   +2 more sources

Notes on inverse bin-packing problems

Information Processing Letters, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yerim Chung, Myoung-Ju Park
openaire   +2 more sources

A note on a selfish bin packing problem

Journal of Global Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ye, D, Ma, R, Dósa, G, Han, X, Ting, HF, Zhang, Y   +5 more
openaire   +3 more sources

Bin‐packing problem with concave costs of bin utilization

Naval Research Logistics (NRL), 2006
AbstractWe consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD).
Li, Chung-Lun, Chen, Zhi-Long
openaire   +1 more source

The Bin Packing Problem with Precedence Constraints

Operations Research, 2012
Given a set of identical capacitated bins, a set of weighted items, and a set of precedences among such items, we are interested in determining the minimum number of bins that can accommodate all items and can be ordered in such a way that all precedences are satisfied. The problem, denoted as the bin packing problem with precedence constraints (BPP-P)
DELL'AMICO, Mauro, DIAZ DIAZ, Jose Carlos, IORI, MANUEL   +2 more
openaire   +2 more sources

A Robust APTAS for the Classical Bin Packing Problem

Mathematical Programming, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leah Epstein, Asaf Levin
openaire   +1 more source

Bin Packing and Covering Problems with Rejection

2005
In this paper we consider the following problems: We are given a set of n items {u1, ⋯, un}, each item ui is characterized by its size wi∈ (0,1] and its penalty/profit pi≥ 0, and a number of unit-capacity bins. An item can be either rejected, in which case we pay/get its penalty/profit, or put into one bin under the constraint that the total size of ...
Yong He, György Dósa
openaire   +1 more source