A heuristic for the minimization of open stacks problem
It is suggested here a fast and easy to implement heuristic for the minimization of open stacks problem (MOSP). The problem is modeled as a traversing problem in a graph (Gmosp) with a special structure (Yanasse, 1997b). It was observed in Ashikaga (2001) that, in the mean experimental case, Gmosp h...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sociedade Brasileira de Pesquisa Operacional
2009-08-01
|
| Series: | Pesquisa Operacional |
| Subjects: | |
| Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382009000200010 |