Sciweavers

360 search results - page 6 / 72
» The TV-Break Packing Problem
Sort
View
MOR
2006
123views more  MOR 2006»
13 years 7 months ago
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
Nikhil Bansal, José R. Correa, Claire Kenyo...
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 7 months ago
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
Richard Beigel, Bin Fu
EOR
2002
85views more  EOR 2002»
13 years 7 months ago
An improved algorithm for the packing of unequal circles within a larger containing circle
This paper describes an approved algorithm for the problems of unequal circle packing
Huaiqing Wang, Wenqi Huang, Quan Zhang, Dongming X...
AISS
2010
161views more  AISS 2010»
13 years 4 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
SIAMCOMP
2008
132views more  SIAMCOMP 2008»
13 years 7 months ago
An APTAS for Generalized Cost Variable-Sized Bin Packing
Bin packing is a well known problem which has a large number of applications. Classical bin packing is a simple model where all bins are identical. In the bin packing problem with...
Leah Epstein, Asaf Levin