The minimization of open stacks problem: A review of some properties and their use in pre-processing operations
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
20/05/2014
20/05/2014
16/06/2010
|
Resumo |
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Pre-processing operations that reduce the size of a problem may be decisive for solving or not solving practical instances of a NP-hard problem. In this article we review some properties suggested in the literature for the minimization of open stacks problem that can be used in pre-processing operations to reduce the instances sizes. We also present a new pre-processing technique that may be very effective in reducing the size of an instance. We present computational tests with the suggested pre-processing operations applied on sets of MOSP instances of the literature and we show that the reductions obtained can be significant. (C) 2009 Elsevier B.V. All rights reserved. |
Formato |
559-567 |
Identificador |
http://dx.doi.org/10.1016/j.ejor.2009.09.017 European Journal of Operational Research. Amsterdam: Elsevier B.V., v. 203, n. 3, p. 559-567, 2010. 0377-2217 http://hdl.handle.net/11449/9286 10.1016/j.ejor.2009.09.017 WOS:000272588300003 |
Idioma(s) |
eng |
Publicador |
Elsevier B.V. |
Relação |
European Journal of Operational Research |
Direitos |
closedAccess |
Palavras-Chave | #Combinatorial optimization #Minimization of open stack problem #Pre-processing #Size reduction |
Tipo |
info:eu-repo/semantics/article |