An Exact Algorithm for Higher-Dimensional Orthogonal Packing
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree...
Gespeichert in:
| Veröffentlicht in: | Operations research 2007-05, Vol.55 (3), p.569-587 |
|---|---|
| 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 | 587 |
|---|---|
| container_issue | 3 |
| container_start_page | 569 |
| container_title | Operations research |
| container_volume | 55 |
| creator | Fekete, Sandor P Schepers, Jorg van der Veen, Jan C |
| description | Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree search algorithm for solving higher-dimensional packing problems to optimality. Computational results are reported, including optimal solutions for all two-dimensional test problems from recent literature.
This is the third in a series of articles describing new approaches to higher-dimensional packing. |
| doi_str_mv | 10.1287/opre.1060.0369 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_18860015</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A166351597</galeid><jstor_id>25147100</jstor_id><sourcerecordid>A166351597</sourcerecordid><originalsourceid>FETCH-LOGICAL-c570t-dd1ea42e03074b7d9caa7df1b705c5b55348712b5d3384d225e801a0c64413a63</originalsourceid><addsrcrecordid>eNqFkUGL1DAYhoMoOK5evQlF0FvHfE2-pAUvw-7qCgvrQcFbyKRpJ2PbjF-6qP_e1C7rRZQcEpLnTd7wMPYc-BaqWr-JJ_Jb4IpvuVDNA7YBrFSJUomHbMO54KVQ8stj9iSlI-e8QYUb9nY3FZc_rJuL3dBHCvNhLLpIxVXoD57KizD6KYU42aG4ofkQ-9_Lj9Z9DVP_lD3q7JD8s7v5jH1-d_np_Kq8vnn_4Xx3XTrUfC7bFryVlc8VtNzrtnHW6raDvebocI8oZK2h2mMrRC3bqkJfc7DcKSlBWCXO2Mv13hPFb7c-zeYYbykXSaaCBhoJSmeoXKHeDt6EqYszWdf7yZMd4uS7kLd3oJRAwGbht3_h82j9GNy_Ao5iSuQ7c6IwWvppgJvFgFkMmMWAWQzkwKu72jY5O3RkJxfSn1RdK84BM_di5Y5pjnR_XiFIDVnc_c-WkjSm_7_7euUPWeL3QOvvluACJoNohMEM_gJ0JqoJ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>219194167</pqid></control><display><type>article</type><title>An Exact Algorithm for Higher-Dimensional Orthogonal Packing</title><source>Jstor Complete Legacy</source><source>Informs</source><source>EBSCOhost Business Source Complete</source><creator>Fekete, Sandor P ; Schepers, Jorg ; van der Veen, Jan C</creator><creatorcontrib>Fekete, Sandor P ; Schepers, Jorg ; van der Veen, Jan C</creatorcontrib><description>Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree search algorithm for solving higher-dimensional packing problems to optimality. Computational results are reported, including optimal solutions for all two-dimensional test problems from recent literature.
This is the third in a series of articles describing new approaches to higher-dimensional packing.</description><identifier>ISSN: 0030-364X</identifier><identifier>EISSN: 1526-5463</identifier><identifier>DOI: 10.1287/opre.1060.0369</identifier><identifier>CODEN: OPREAI</identifier><language>eng</language><publisher>Linthicum, MD: INFORMS</publisher><subject>Algorithms ; Analysis ; Applied sciences ; Coordinate systems ; cutting stock ; Data models ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Heuristics ; Induced subgraphs ; Libraries ; Mathematics ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Optimal solutions ; Optimization ; Packing problem ; production ; Run time ; scheduling ; Studies ; trim ; Vertices</subject><ispartof>Operations research, 2007-05, Vol.55 (3), p.569-587</ispartof><rights>Copyright 2007 INFORMS</rights><rights>2007 INIST-CNRS</rights><rights>COPYRIGHT 2007 Institute for Operations Research and the Management Sciences</rights><rights>Copyright Institute for Operations Research and the Management Sciences May/Jun 2007</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c570t-dd1ea42e03074b7d9caa7df1b705c5b55348712b5d3384d225e801a0c64413a63</citedby><cites>FETCH-LOGICAL-c570t-dd1ea42e03074b7d9caa7df1b705c5b55348712b5d3384d225e801a0c64413a63</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/25147100$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/opre.1060.0369$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,776,780,799,3679,27901,27902,57992,58225,62589</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18860015$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Fekete, Sandor P</creatorcontrib><creatorcontrib>Schepers, Jorg</creatorcontrib><creatorcontrib>van der Veen, Jan C</creatorcontrib><title>An Exact Algorithm for Higher-Dimensional Orthogonal Packing</title><title>Operations research</title><description>Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree search algorithm for solving higher-dimensional packing problems to optimality. Computational results are reported, including optimal solutions for all two-dimensional test problems from recent literature.
This is the third in a series of articles describing new approaches to higher-dimensional packing.</description><subject>Algorithms</subject><subject>Analysis</subject><subject>Applied sciences</subject><subject>Coordinate systems</subject><subject>cutting stock</subject><subject>Data models</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Heuristics</subject><subject>Induced subgraphs</subject><subject>Libraries</subject><subject>Mathematics</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Optimal solutions</subject><subject>Optimization</subject><subject>Packing problem</subject><subject>production</subject><subject>Run time</subject><subject>scheduling</subject><subject>Studies</subject><subject>trim</subject><subject>Vertices</subject><issn>0030-364X</issn><issn>1526-5463</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNqFkUGL1DAYhoMoOK5evQlF0FvHfE2-pAUvw-7qCgvrQcFbyKRpJ2PbjF-6qP_e1C7rRZQcEpLnTd7wMPYc-BaqWr-JJ_Jb4IpvuVDNA7YBrFSJUomHbMO54KVQ8stj9iSlI-e8QYUb9nY3FZc_rJuL3dBHCvNhLLpIxVXoD57KizD6KYU42aG4ofkQ-9_Lj9Z9DVP_lD3q7JD8s7v5jH1-d_np_Kq8vnn_4Xx3XTrUfC7bFryVlc8VtNzrtnHW6raDvebocI8oZK2h2mMrRC3bqkJfc7DcKSlBWCXO2Mv13hPFb7c-zeYYbykXSaaCBhoJSmeoXKHeDt6EqYszWdf7yZMd4uS7kLd3oJRAwGbht3_h82j9GNy_Ao5iSuQ7c6IwWvppgJvFgFkMmMWAWQzkwKu72jY5O3RkJxfSn1RdK84BM_di5Y5pjnR_XiFIDVnc_c-WkjSm_7_7euUPWeL3QOvvluACJoNohMEM_gJ0JqoJ</recordid><startdate>20070501</startdate><enddate>20070501</enddate><creator>Fekete, Sandor P</creator><creator>Schepers, Jorg</creator><creator>van der Veen, Jan C</creator><general>INFORMS</general><general>Institute for Operations Research and the Management Sciences</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>88F</scope><scope>8AL</scope><scope>8AO</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M1Q</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PJZUB</scope><scope>PKEHL</scope><scope>PPXIY</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20070501</creationdate><title>An Exact Algorithm for Higher-Dimensional Orthogonal Packing</title><author>Fekete, Sandor P ; Schepers, Jorg ; van der Veen, Jan C</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c570t-dd1ea42e03074b7d9caa7df1b705c5b55348712b5d3384d225e801a0c64413a63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithms</topic><topic>Analysis</topic><topic>Applied sciences</topic><topic>Coordinate systems</topic><topic>cutting stock</topic><topic>Data models</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Heuristics</topic><topic>Induced subgraphs</topic><topic>Libraries</topic><topic>Mathematics</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Optimal solutions</topic><topic>Optimization</topic><topic>Packing problem</topic><topic>production</topic><topic>Run time</topic><topic>scheduling</topic><topic>Studies</topic><topic>trim</topic><topic>Vertices</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fekete, Sandor P</creatorcontrib><creatorcontrib>Schepers, Jorg</creatorcontrib><creatorcontrib>van der Veen, Jan C</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>ProQuest Health & Medical Research Collection</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Health & Nursing</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied & Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fekete, Sandor P</au><au>Schepers, Jorg</au><au>van der Veen, Jan C</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Exact Algorithm for Higher-Dimensional Orthogonal Packing</atitle><jtitle>Operations research</jtitle><date>2007-05-01</date><risdate>2007</risdate><volume>55</volume><issue>3</issue><spage>569</spage><epage>587</epage><pages>569-587</pages><issn>0030-364X</issn><eissn>1526-5463</eissn><coden>OPREAI</coden><abstract>Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree search algorithm for solving higher-dimensional packing problems to optimality. Computational results are reported, including optimal solutions for all two-dimensional test problems from recent literature.
This is the third in a series of articles describing new approaches to higher-dimensional packing.</abstract><cop>Linthicum, MD</cop><pub>INFORMS</pub><doi>10.1287/opre.1060.0369</doi><tpages>19</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0030-364X |
| ispartof | Operations research, 2007-05, Vol.55 (3), p.569-587 |
| issn | 0030-364X 1526-5463 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_18860015 |
| source | Jstor Complete Legacy; Informs; EBSCOhost Business Source Complete |
| subjects | Algorithms Analysis Applied sciences Coordinate systems cutting stock Data models Exact sciences and technology Flows in networks. Combinatorial problems Heuristics Induced subgraphs Libraries Mathematics Operational research and scientific management Operational research. Management science Operations research Optimal solutions Optimization Packing problem production Run time scheduling Studies trim Vertices |
| title | An Exact Algorithm for Higher-Dimensional Orthogonal Packing |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-21T20%3A05%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Exact%20Algorithm%20for%20Higher-Dimensional%20Orthogonal%20Packing&rft.jtitle=Operations%20research&rft.au=Fekete,%20Sandor%20P&rft.date=2007-05-01&rft.volume=55&rft.issue=3&rft.spage=569&rft.epage=587&rft.pages=569-587&rft.issn=0030-364X&rft.eissn=1526-5463&rft.coden=OPREAI&rft_id=info:doi/10.1287/opre.1060.0369&rft_dat=%3Cgale_pasca%3EA166351597%3C/gale_pasca%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=219194167&rft_id=info:pmid/&rft_galeid=A166351597&rft_jstor_id=25147100&rfr_iscdi=true |