Sciweavers

360 search results - page 30 / 72
» The TV-Break Packing Problem
Sort
View
ECCC
2006
80views more  ECCC 2006»
14 years 12 months ago
Packing to angles and sectors
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,
Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasivis...
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
15 years 4 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria
SAC
2005
ACM
15 years 5 months ago
The container loading problem
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...
Andrew Lim, Xingwen Zhang
EOR
2007
88views more  EOR 2007»
14 years 11 months ago
The minimum size instance of a Pallet Loading Problem equivalence class
The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90° so long as they are packed with ...
Gustavo H. A. Martins, Robert F. Dell
EOR
2006
73views more  EOR 2006»
14 years 12 months ago
An exact algorithm for the knapsack sharing problem with common items
We are concerned with a variation of the knapsack problem as well as of the knapsack sharing problem, where we are given a set of n items and a knapsack of a fixed capacity. As us...
Masako Fujimoto, Takeo Yamada