Title
The minimization of open stacks problem: A review of some properties and their use in pre-processing operations
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.
Year
DOI
Venue
2010
10.1016/j.ejor.2009.09.017
European Journal of Operational Research
Keywords
Field
DocType
Combinatorial optimization,Minimization of open stack problem,Pre-processing,Size reduction
Mathematical optimization,Stack (abstract data type),Algorithm,Combinatorial optimization,Size reduction,Minification,Minimisation (psychology),Cutting stock problem,Mathematics
Journal
Volume
Issue
ISSN
203
3
0377-2217
Citations 
PageRank 
References 
6
0.47
15
Authors
2
Name
Order
Citations
PageRank
Horacio Hideki Yanasse119317.45
Edson Luiz França Senne2302.83