The minimization of open stacks problem: A review of some properties and their use in pre-processing operations
Loading...
Files
External sources
External sources
Date
Advisor
Coadvisor
Graduate program
Undergraduate course
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier B.V.
Type
Article
Access right
Acesso restrito
Files
External sources
External sources
Abstract
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.
Description
Keywords
Combinatorial optimization, Minimization of open stack problem, Pre-processing, Size reduction
Language
English
Citation
European Journal of Operational Research. Amsterdam: Elsevier B.V., v. 203, n. 3, p. 559-567, 2010.
