Sciweavers

106 search results - page 5 / 22
» An Improved Algorithm for Optimal Bin Packing
Sort
View
87
Voted
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
15 years 3 months ago
Online Bin Packing with Cardinality Constraints
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
Leah Epstein
94
Voted
SODA
2004
ACM
203views Algorithms» more  SODA 2004»
14 years 11 months ago
Approximation schemes for multidimensional packing
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
José R. Correa, Claire Kenyon
AISS
2010
161views more  AISS 2010»
14 years 7 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
95
Voted
SIAMJO
2008
175views more  SIAMJO 2008»
14 years 10 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
91
Voted
PPSN
1998
Springer
15 years 2 months ago
Genetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
Günther R. Raidl, Gabriele Kodydek