Sciweavers

64 search results - page 3 / 13
» Bin Packing with Fixed Number of Bins Revisited
Sort
View
IOR
2008
102views more  IOR 2008»
13 years 7 months ago
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be ex...
Alberto Ceselli, Giovanni Righini
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...
CVPR
2001
IEEE
14 years 9 months ago
Adaptive Binning and Dissimilarity Measure for Image Retrieval and Classification
Color histogram is an important part of content-based image retrieval systems. It is a common understanding that histograms that adapt to images can represent their color distribu...
Wee Kheng Leow, Rui Li
JAIR
2007
141views more  JAIR 2007»
13 years 7 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
14 years 1 months ago
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
Leah Epstein, Rob van Stee