๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A tree search procedure for the container pre-marshalling problem

โœ Scribed by Andreas Bortfeldt; Florian Forster

Book ID
113583880
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
877 KB
Volume
217
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The *-minimax search procedure for trees
The *-minimax search procedure for trees containing chance nodes
โœ Bruce W. Ballard ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1001 KB

An extention of the alpha-beta tree priming strategy to game trees with "probability" nodes, whose values are defined as the (possibly weighted) average of their successors' values, is developed. These '\*-minhnax' trees pertain to games involving chance but no concealed infornzation. Based upon our

A parallel tabu search algorithm for sol
A parallel tabu search algorithm for solving the container loading problem
โœ A Bortfeldt; H Gehring; D Mack ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB

This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al. [Iss