The minimization of open stacks problem: A review of some properties and their use in pre-processing operations

dc.contributorInstituto Nacional de Pesquisas Espaciais (INPE)
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T13:27:58Z
dc.date.available2014-05-20T13:27:58Z
dc.date.created2014-05-20T13:27:58Z
dc.date.issued2010-06-16
dc.identifierEuropean Journal of Operational Research. Amsterdam: Elsevier B.V., v. 203, n. 3, p. 559-567, 2010.
dc.identifier0377-2217
dc.identifierhttp://hdl.handle.net/11449/9286
dc.identifier10.1016/j.ejor.2009.09.017
dc.identifierWOS:000272588300003
dc.identifier1338008237590056
dc.identifier0000-0002-6544-2964
dc.description.abstractPre-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.
dc.languageeng
dc.publisherElsevier B.V.
dc.relationEuropean Journal of Operational Research
dc.relation3.428
dc.relation2,437
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectCombinatorial optimization
dc.subjectMinimization of open stack problem
dc.subjectPre-processing
dc.subjectSize reduction
dc.titleThe minimization of open stacks problem: A review of some properties and their use in pre-processing operations
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución