The minimization of open stacks problem: A review of some properties and their use in pre-processing operations
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 operat...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 2010-06, Vol.203 (3), p.559-567 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 567 |
|---|---|
| container_issue | 3 |
| container_start_page | 559 |
| container_title | European journal of operational research |
| container_volume | 203 |
| creator | Yanasse, Horacio Hideki Senne, Edson Luiz França |
| description | 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. |
| doi_str_mv | 10.1016/j.ejor.2009.09.017 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204149434</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221709006328</els_id><sourcerecordid>1908511131</sourcerecordid><originalsourceid>FETCH-LOGICAL-c456t-da89b62fb9c93da7c3f32384f007a4f6f2cf8bdf6aa78e9992a1aab2d5cf47293</originalsourceid><addsrcrecordid>eNp9UU1v1DAQtRBILIU_wMlC4pjFX4ljxKWq-BKVuJSzNXHGrMMmDna2qPx67G7VI6MZ2_K8eR6_IeQ1Z3vOePdu2uMU014wZvbVuX5CdrzXoun6jj0lOya1boTg-jl5kfPEGOMtb3ck3hyQzmEJc_gLW4gLjZ7GFReaN3C_Ml1THI44v6eXNOFtwD8VkOOMNbNi2gJmCstItwOGRE8ZaVhKDpuSd5hzWH5WwnTPnl-SZx6OGV897Bfkx6ePN1dfmuvvn79eXV43TrXd1ozQm6ETfjDOyBG0k14K2SvPmAblOy-c74fRdwC6R2OMAA4wiLF1Xmlh5AV5c-YtXfw-Yd7sFE9pKU9awRRXRklVQOIMcinmnNDbNYUZ0p3lzFZd7WSrrrbqaqtzXYq-nYsSrugeK7BYgWK2t1aCYLKsd_enwiUhlKhXa4m2NbbttD1sc2F7-9AnZAdHn2BxIT-yimKGqfqfD2ccFtHKGJLNLuDicAwJ3WbHGP7X9D9qY6m5</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204149434</pqid></control><display><type>article</type><title>The minimization of open stacks problem: A review of some properties and their use in pre-processing operations</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Yanasse, Horacio Hideki ; Senne, Edson Luiz França</creator><creatorcontrib>Yanasse, Horacio Hideki ; Senne, Edson Luiz França</creatorcontrib><description>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.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2009.09.017</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Combinatorial optimization ; Combinatorial optimization Minimization of open stack problem Pre-processing Size reduction ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Minimization of open stack problem ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Optimization algorithms ; Pre-processing ; Problem solving ; Size reduction ; Studies</subject><ispartof>European journal of operational research, 2010-06, Vol.203 (3), p.559-567</ispartof><rights>2009 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Jun 16, 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c456t-da89b62fb9c93da7c3f32384f007a4f6f2cf8bdf6aa78e9992a1aab2d5cf47293</citedby><cites>FETCH-LOGICAL-c456t-da89b62fb9c93da7c3f32384f007a4f6f2cf8bdf6aa78e9992a1aab2d5cf47293</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0377221709006328$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,3994,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22229049$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a203_3ay_3a2010_3ai_3a3_3ap_3a559-567.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Yanasse, Horacio Hideki</creatorcontrib><creatorcontrib>Senne, Edson Luiz França</creatorcontrib><title>The minimization of open stacks problem: A review of some properties and their use in pre-processing operations</title><title>European journal of operational research</title><description>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.</description><subject>Applied sciences</subject><subject>Combinatorial optimization</subject><subject>Combinatorial optimization Minimization of open stack problem Pre-processing Size reduction</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Minimization of open stack problem</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Optimization algorithms</subject><subject>Pre-processing</subject><subject>Problem solving</subject><subject>Size reduction</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9UU1v1DAQtRBILIU_wMlC4pjFX4ljxKWq-BKVuJSzNXHGrMMmDna2qPx67G7VI6MZ2_K8eR6_IeQ1Z3vOePdu2uMU014wZvbVuX5CdrzXoun6jj0lOya1boTg-jl5kfPEGOMtb3ck3hyQzmEJc_gLW4gLjZ7GFReaN3C_Ml1THI44v6eXNOFtwD8VkOOMNbNi2gJmCstItwOGRE8ZaVhKDpuSd5hzWH5WwnTPnl-SZx6OGV897Bfkx6ePN1dfmuvvn79eXV43TrXd1ozQm6ETfjDOyBG0k14K2SvPmAblOy-c74fRdwC6R2OMAA4wiLF1Xmlh5AV5c-YtXfw-Yd7sFE9pKU9awRRXRklVQOIMcinmnNDbNYUZ0p3lzFZd7WSrrrbqaqtzXYq-nYsSrugeK7BYgWK2t1aCYLKsd_enwiUhlKhXa4m2NbbttD1sc2F7-9AnZAdHn2BxIT-yimKGqfqfD2ccFtHKGJLNLuDicAwJ3WbHGP7X9D9qY6m5</recordid><startdate>20100616</startdate><enddate>20100616</enddate><creator>Yanasse, Horacio Hideki</creator><creator>Senne, Edson Luiz França</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20100616</creationdate><title>The minimization of open stacks problem: A review of some properties and their use in pre-processing operations</title><author>Yanasse, Horacio Hideki ; Senne, Edson Luiz França</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c456t-da89b62fb9c93da7c3f32384f007a4f6f2cf8bdf6aa78e9992a1aab2d5cf47293</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Applied sciences</topic><topic>Combinatorial optimization</topic><topic>Combinatorial optimization Minimization of open stack problem Pre-processing Size reduction</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Minimization of open stack problem</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Optimization algorithms</topic><topic>Pre-processing</topic><topic>Problem solving</topic><topic>Size reduction</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yanasse, Horacio Hideki</creatorcontrib><creatorcontrib>Senne, Edson Luiz França</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yanasse, Horacio Hideki</au><au>Senne, Edson Luiz França</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The minimization of open stacks problem: A review of some properties and their use in pre-processing operations</atitle><jtitle>European journal of operational research</jtitle><date>2010-06-16</date><risdate>2010</risdate><volume>203</volume><issue>3</issue><spage>559</spage><epage>567</epage><pages>559-567</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><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.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2009.09.017</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 2010-06, Vol.203 (3), p.559-567 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204149434 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Applied sciences Combinatorial optimization Combinatorial optimization Minimization of open stack problem Pre-processing Size reduction Exact sciences and technology Flows in networks. Combinatorial problems Minimization of open stack problem Operational research and scientific management Operational research. Management science Operations research Optimization algorithms Pre-processing Problem solving Size reduction Studies |
| title | The minimization of open stacks problem: A review of some properties and their use in pre-processing operations |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T22%3A31%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20minimization%20of%20open%20stacks%20problem:%20A%20review%20of%20some%20properties%20and%20their%20use%20in%20pre-processing%20operations&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Yanasse,%20Horacio%20Hideki&rft.date=2010-06-16&rft.volume=203&rft.issue=3&rft.spage=559&rft.epage=567&rft.pages=559-567&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2009.09.017&rft_dat=%3Cproquest_cross%3E1908511131%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204149434&rft_id=info:pmid/&rft_els_id=S0377221709006328&rfr_iscdi=true |