Jul 3, 2012 · We present a mixed zero-one integer linear programming (MZOILP) formulation of this one-dimensional minimax bin-packing problem and develop an ...
We present a mixed zero-one integer linear programming (MZOILP) formulation of this one-dimensional minimax bin-packing problem and develop an approximate ...
Feb 7, 2014 · In this note, we show that this problem is NP-hard for the special case and that it is strongly NP-hard for the general problem. We also propose ...
One-dimensional bin-packing problems require the assignment of a collection of items to bins with the goal of optimizing some criterion related to the ...
By Michael Brusco, Hans Köhn and Douglas Steinley; Abstract: One-dimensional bin-packing problems require the assignment of a collection of items to bins ...
The goal of these problems is to construct one or multiple tests to evaluate the test subject. This paper studies a recent formulation of the problem known as ...
, Annals of operations research. , 2013, Vol.206(1), p.611-626 ,. Exact and approximate methods for a one-dimensional minimax bin-packing problem Available ...
Mariona Vilà, Jordi Pereira: A note on 'Exact and approximate methods for a one-dimensional minimax bin-packing problem' [Annals of Operations Research ...
People also ask
What is the one dimensional bin packing problem?
What is the best algorithm for bin packing?
What is bin packing algorithm approximation?
What is the maximum resource bin packing problem?
The one-dimensional bin packing problem has many applications to problems of data management, scheduling and resource allocation.
Perhaps the simplest algorithm for the classical one-dimensional bin packing problem is Next Fit (NF), apparently rst described under this name in [Joh73].