Results 1  10
of
555,767
The Lazy Bin Packing Problem
, 2004
"... Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number of accepted items or accepted volume. This paper presents results for the opposite problems, where we want to maximize the number of bins used or minimize ..."
Abstract
 Add to MetaCart
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number of accepted items or accepted volume. This paper presents results for the opposite problems, where we want to maximize the number of bins used
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 [3, 5, 8, 10, 11, 12]. Within this framework, it is shown that a new algorithm, Harmonic++, has asymptotic perfor ..."
Local Search For The Bin Packing Problem
, 1999
"... . The bin packing problem consists in finding the minimum number of bins of given capacity which are necessary to pack a certain number of itens. In this work, we propose an improvement procedure for the bin packing problem, based on the progressive reduction of the number of bins used by a previous ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. The bin packing problem consists in finding the minimum number of bins of given capacity which are necessary to pack a certain number of itens. In this work, we propose an improvement procedure for the bin packing problem, based on the progressive reduction of the number of bins used by a
On a Constrained Binpacking Problem
, 1995
"... We study a binpacking problem which is onedimensional and is constrained in the manner items are placed into bins. The problem is motivated by a practical realtime scheduling problem, where redundant periodic tasks need to be assigned to a multiprocessor system. The problem is stated in the tradit ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We study a binpacking problem which is onedimensional and is constrained in the manner items are placed into bins. The problem is motivated by a practical realtime scheduling problem, where redundant periodic tasks need to be assigned to a multiprocessor system. The problem is stated
The ThreeDimensional Bin Packing Problem
 Operations Research
, 2000
"... The problem addressed in this paper is that of orthogonally packing a given set of rectangularshaped boxes into the minimum number of rectangular bins. The problem is strongly NPhard and extremely difficult to solve in practice. Lower bounds are discussed, and it is proved that the asymptotical wo ..."
Abstract

Cited by 57 (6 self)
 Add to MetaCart
The problem addressed in this paper is that of orthogonally packing a given set of rectangularshaped boxes into the minimum number of rectangular bins. The problem is strongly NPhard and extremely difficult to solve in practice. Lower bounds are discussed, and it is proved that the asymptotical
The Maximum Resource Bin Packing Problem
, 2005
"... Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. This paper presents results for the opposite problems, where we would like to maximize the number of bins used or minimiz ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. This paper presents results for the opposite problems, where we would like to maximize the number of bins used
Variants of the ThreeDimensional Bin Packing Problem
, 2016
"... Algorithm 864: General and robotpackable variants of the threedimensional bin packing problem. ..."
Abstract
 Add to MetaCart
Algorithm 864: General and robotpackable variants of the threedimensional bin packing problem.
Evolutionary Heuristics for the Bin Packing Problem
 PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON ARTIFICIAL NEURAL NETWORKS AND GENETIC ALGORITHMS
, 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 d ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
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
A hybrid artificial fish swarm algorithm for Binpacking problem
 in Proceedings of the International Conference on Electronic and Mechanical Engineering and Information Technology (EMEIT ’11
, 2011
"... Abstract—Binpacking problem is widely applied in the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—Binpacking problem is widely applied in the
Results 1  10
of
555,767