Sciweavers

360 search results - page 9 / 72
» The TV-Break Packing Problem
Sort
View
COCOON
2006
Springer
13 years 11 months ago
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
E. C. Xavier, Flávio Keidi Miyazawa
EOR
2006
91views more  EOR 2006»
13 years 7 months ago
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
A. Miguel Gomes, José F. Oliveira
FCT
2007
Springer
13 years 11 months ago
Multi-dimensional Packing with Conflicts
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
Leah Epstein, Asaf Levin, Rob van Stee
CSCW
2000
ACM
13 years 11 months ago
Coping with errors: the importance of process data in robust sociotechnical systems
This paper presents an analysis of written and electronic records that document the collaborative process of packing museum artifacts in preparation for a move. The majority of da...
Michael Twidale, Paul F. Marty
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