24 search results - page 2 / 5 » A Maximal-Space Algorithm for the Container Loading Problem |
JACIII
2007
13 years 7 months ago
2007
SAC
2005
ACM
14 years 1 months ago
2005
ACM
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...
NETWORKS
2010
13 years 6 months ago
2010
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
ICDCN
2011
Springer
12 years 11 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
COMPSAC
2002
IEEE
14 years 16 days ago
2002
IEEE
In the near future, container ports will no longer be able to expand into the surrounding land and will thus be unable to meet the storage requirements due to the boom in world tr...