6 search results - page 1 / 2 » Minimizing the Maximum Number of Open Stacks by Customer Sea... |
CP
2009
Springer
13 years 2 months ago
2009
Springer
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
INFORMS
2007
13 years 4 months ago
2007
JPDC
2010
12 years 11 months ago
2010
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
COR
1999
13 years 4 months ago
1999
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
EMSOFT
2005
Springer
13 years 10 months ago
2005
Springer
Early applications of smart cards have focused in the area of personal security. Recently, there has been an increasing demand for networked, multi-application cards. In this new ...