Department of Logistics2008-2009 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
For NP-complete problems, it may not be possible to find an optimal solution in polynomial time. How...
We analyze the one-dimensional bin-packing problem under the assumption that bins have unit capacity...
AbstractWe revisit three famous bin packing algorithms, namely Next Fit (NF), Worst Fit (WF) and Fir...
We consider a generalized one-dimensional bin packing model in which the cost of a bin is a nondecre...
We present a worst case analysis for the Generalized Bin Packing Problem, a novel packing problem ar...
Low-order polynomial time algorithms for near-optimal solutions to the problem of bin packing are st...
Abstract“Bin packing with rejection” is the following problem: Given a list of items with associated...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1973.Vita.Bibliography...
In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bi...
AbstractIn the bin covering problem there is a group L=(a1,…,an) of items with sizes s̃(ai)∈(0,1), a...
AbstractThe FIRST FIT DECREASING algorithm for bin packing has long been famous for its guarantee th...
AbstractThe two-dimensional bin packing problem is a generalization of the classical bin packing pro...
AbstractIt is well known that the two simple algorithms for the classic bin packing problem, NF and ...
AbstractThis paper unifies and generalizes the existing lower bounds for the one-dimensional bin pac...
AbstractOn-line algorithms have been extensively studied for the one-dimensional bin packing problem...
For NP-complete problems, it may not be possible to find an optimal solution in polynomial time. How...
We analyze the one-dimensional bin-packing problem under the assumption that bins have unit capacity...
AbstractWe revisit three famous bin packing algorithms, namely Next Fit (NF), Worst Fit (WF) and Fir...
We consider a generalized one-dimensional bin packing model in which the cost of a bin is a nondecre...
We present a worst case analysis for the Generalized Bin Packing Problem, a novel packing problem ar...
Low-order polynomial time algorithms for near-optimal solutions to the problem of bin packing are st...
Abstract“Bin packing with rejection” is the following problem: Given a list of items with associated...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1973.Vita.Bibliography...
In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bi...
AbstractIn the bin covering problem there is a group L=(a1,…,an) of items with sizes s̃(ai)∈(0,1), a...
AbstractThe FIRST FIT DECREASING algorithm for bin packing has long been famous for its guarantee th...
AbstractThe two-dimensional bin packing problem is a generalization of the classical bin packing pro...
AbstractIt is well known that the two simple algorithms for the classic bin packing problem, NF and ...
AbstractThis paper unifies and generalizes the existing lower bounds for the one-dimensional bin pac...
AbstractOn-line algorithms have been extensively studied for the one-dimensional bin packing problem...
For NP-complete problems, it may not be possible to find an optimal solution in polynomial time. How...
We analyze the one-dimensional bin-packing problem under the assumption that bins have unit capacity...
AbstractWe revisit three famous bin packing algorithms, namely Next Fit (NF), Worst Fit (WF) and Fir...
DOI
Add to ORKG