The board packing problem
•The board packing problem (BoPP) is introduced.•BoPP subsumes several natural optimization problems that arise in practice.•We prove that BoPP is NP-hard by reduction from the satisfiability problem.•An evolutionary algorithm is developed that can solve large instances of BoPP.•We introduce benchma...
Uložené v:
| Vydané v: | European journal of operational research Ročník 308; číslo 3; s. 1056 - 1073 |
|---|---|
| Hlavní autori: | , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.08.2023
|
| Predmet: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •The board packing problem (BoPP) is introduced.•BoPP subsumes several natural optimization problems that arise in practice.•We prove that BoPP is NP-hard by reduction from the satisfiability problem.•An evolutionary algorithm is developed that can solve large instances of BoPP.•We introduce benchmark instances and make extensive computer examinations.
We introduce the board packing problem (BoPP). In this problem we are given a rectangular board with a given number of rows and columns. Each position of the board has an integer value representing a gain, or revenue, that is obtained if the position is covered. A set of rectangles is also given, each with a given size and cost. The objective is to purchase some rectangles to place on the board so as to maximize the profit, which is the sum of the gain values of the covered cells minus the total cost of purchased rectangles. This problem subsumes several natural optimization problems that arise in practice. A mixed-integer programming model for the BoPP problem is provided, along with a proof that BoPP is NP-hard by reduction from the satisfiability problem. An evolutionary algorithm is also developed that can solve large instances of BoPP. We introduce benchmark instances and make extensive computer examinations. |
|---|---|
| AbstractList | •The board packing problem (BoPP) is introduced.•BoPP subsumes several natural optimization problems that arise in practice.•We prove that BoPP is NP-hard by reduction from the satisfiability problem.•An evolutionary algorithm is developed that can solve large instances of BoPP.•We introduce benchmark instances and make extensive computer examinations.
We introduce the board packing problem (BoPP). In this problem we are given a rectangular board with a given number of rows and columns. Each position of the board has an integer value representing a gain, or revenue, that is obtained if the position is covered. A set of rectangles is also given, each with a given size and cost. The objective is to purchase some rectangles to place on the board so as to maximize the profit, which is the sum of the gain values of the covered cells minus the total cost of purchased rectangles. This problem subsumes several natural optimization problems that arise in practice. A mixed-integer programming model for the BoPP problem is provided, along with a proof that BoPP is NP-hard by reduction from the satisfiability problem. An evolutionary algorithm is also developed that can solve large instances of BoPP. We introduce benchmark instances and make extensive computer examinations. |
| Author | Dosa, Gyorgy Tuza, Zsolt Olaj, Tomas Attila Hvattum, Lars Magnus Abraham, Gyula |
| Author_xml | – sequence: 1 givenname: Gyula surname: Abraham fullname: Abraham, Gyula email: abraham.gyula@virt.uni-pannon.hu organization: University of Pannonia, Veszprém, Hungary – sequence: 2 givenname: Gyorgy orcidid: 0000-0002-4909-6694 surname: Dosa fullname: Dosa, Gyorgy email: dosagy@almos.uni-pannon.hu, dosagy@almos.vein.hu organization: University of Pannonia, Veszprém, Hungary – sequence: 3 givenname: Lars Magnus orcidid: 0000-0003-0490-9978 surname: Hvattum fullname: Hvattum, Lars Magnus email: lars.m.hvattum@himolde.no organization: Faculty of Logistics, Molde University College, Norway – sequence: 4 givenname: Tomas Attila surname: Olaj fullname: Olaj, Tomas Attila email: tomas@olaj.no organization: University of Pannonia, Veszprém, Hungary – sequence: 5 givenname: Zsolt surname: Tuza fullname: Tuza, Zsolt email: tuza@dcs.uni-pannon.hu organization: University of Pannonia, Veszprém, Hungary |
| BookMark | eNp9z81KAzEUhuEgFWyrF6Cr3sCM5ySTnwE3UrQKBTd1HSaZE83YTkpmELx7W-rKRVff6vngnbFJn3pi7A6hREB135XUpVxy4KIELEHABZui0bxQRsGETUFoXXCO-orNhqEDAJQop-x280kLl5rcLvaN_4r9x2Kfk9vS7ppdhmY70M3fztn789Nm-VKs31avy8d14Suox0Jzr7irvZCVqclgwJZX4HjrUUgg45xUKgTfBlcTD9ohKqFlLR1XgYwRc2ZOvz6nYcgUrI9jM8bUj7mJW4tgj4m2s8dEe0y0gPaQeKD8H93nuGvyz3n0cEJ0iPqOlO3gI_We2pjJj7ZN8Rz_Bfdbazs |
| CitedBy_id | crossref_primary_10_1007_s10479_025_06787_2 crossref_primary_10_1111_itor_70011 crossref_primary_10_1007_s10479_025_06633_5 |
| Cites_doi | 10.1016/S0305-0548(01)00079-X 10.1016/j.ejor.2016.09.043 10.1057/palgrave.jors.2601548 10.1016/j.ejor.2016.04.039 10.1016/j.cor.2010.01.008 10.1016/S0305-0548(03)00158-8 10.1137/0213014 10.1002/1520-6750(198704)34:2<229::AID-NAV3220340207>3.0.CO;2-1 10.1016/j.ejor.2019.02.004 10.1016/0743-7315(90)90019-L 10.1016/j.ejor.2013.09.045 10.5721/EuJRS20124522 10.1016/j.ejor.2013.04.009 10.11591/eei.v10i6.3244 10.1016/j.cor.2021.105643 10.1111/j.1435-5597.1974.tb00902.x 10.1016/j.comgeo.2012.01.014 10.5194/isprs-archives-XLII-2-W13-297-2019 10.1016/0304-3975(76)90059-1 10.1016/j.ejor.2005.12.047 10.1016/S0020-0190(01)00305-2 10.1145/937503.937505 |
| ContentType | Journal Article |
| Copyright | 2023 The Author(s) |
| Copyright_xml | – notice: 2023 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.ejor.2023.01.030 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 1073 |
| ExternalDocumentID | 10_1016_j_ejor_2023_01_030 S0377221723000498 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6I. 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HVGLF HZ~ R2- VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c409t-72c62b9c35489e81f1d240b2dc1350e8bb566ffcdfb9e2f7b11637595b26fe883 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000957431800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sat Nov 29 07:24:36 EST 2025 Tue Nov 18 22:29:23 EST 2025 Fri Feb 23 02:38:06 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Covering Location problems Combinatorial optimization Genetic algorithm Binary integer programming |
| Language | English |
| License | This is an open access article under the CC BY-NC-ND license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c409t-72c62b9c35489e81f1d240b2dc1350e8bb566ffcdfb9e2f7b11637595b26fe883 |
| ORCID | 0000-0003-0490-9978 0000-0002-4909-6694 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.ejor.2023.01.030 |
| PageCount | 18 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2023_01_030 crossref_primary_10_1016_j_ejor_2023_01_030 elsevier_sciencedirect_doi_10_1016_j_ejor_2023_01_030 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-08-01 |
| PublicationDateYYYYMMDD | 2023-08-01 |
| PublicationDate_xml | – month: 08 year: 2023 text: 2023-08-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2023 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Ghaffarian, Kerle (bib0017) 2019; XLII-2/w13 Church, ReVelle (bib0009) 1974; 32 Abed, Ali, Kadhim (bib0001) 2021; 10 Drezner (bib0013) 1987; 34 Vidal (bib0028) 2022; 140 Demiröz, Altınel, Akarun (bib0011) 2019; 277 Aupperle, Conn, Keil, O’Rourke (bib0002) 1988 Guo, Li, Lou (bib0018) 2021 Mukherjee, Chakraborty (bib0026) 2002; 83 Çakir, Weselowsky (bib0008) 2011; 38 Garey, Johnson (bib0015) 1979 Garey, Johnson, Stockmeyer (bib0016) 1976; 1 Blanquero, Carrizosa, Tóth, Nogales-Gómez (bib0006) 2016; 255 Bereg, Cabello, Diaz-Banez, Pérez-Lantero, Seara, Ventura (bib0003) 2012; 45 Masek, W. J. (1978). Some Wäscher, Haußner, Schumann (bib0030) 2007; 183 Blum, Roli (bib0007) 2003; 35 complete set covering problems. Unpublished manuscript. Dosa, Hvattum, Olaj, Tuza (bib0012) 2020 Martinez-Sykora, Alvarez-Valdes, Bennell, Ruiz, Tamarit (bib0022) 2017; 258 Mondino, Perotti, Piras (bib0025) 2012; 45 Mahapatra, Goswami, Das (bib0021) 2007 Vidal, Crainic, Gendreau, Prins (bib0029) 2014; 234 Leung, Tam, Wong, Young, Chin (bib0020) 1990; 10 Dupont, Lauras, Yugma (bib0014) 2013 Jang, Choi, Bae, Choi (bib0019) 2013; 230 Megiddo, Supowit (bib0024) 1984; 13 Prins (bib0027) 2004; 31 Berman, Drezner, Wesolowsky (bib0004) 2003; 54 Culberson, Reckhow (bib0010) 1988 Berman, Krass (bib0005) 2002; 29 Mahapatra (10.1016/j.ejor.2023.01.030_bib0021) 2007 Wäscher (10.1016/j.ejor.2023.01.030_bib0030) 2007; 183 Dosa (10.1016/j.ejor.2023.01.030_bib0012) 2020 Çakir (10.1016/j.ejor.2023.01.030_bib0008) 2011; 38 Church (10.1016/j.ejor.2023.01.030_bib0009) 1974; 32 Leung (10.1016/j.ejor.2023.01.030_bib0020) 1990; 10 Guo (10.1016/j.ejor.2023.01.030_bib0018) 2021 Bereg (10.1016/j.ejor.2023.01.030_bib0003) 2012; 45 Berman (10.1016/j.ejor.2023.01.030_bib0004) 2003; 54 Mondino (10.1016/j.ejor.2023.01.030_bib0025) 2012; 45 Abed (10.1016/j.ejor.2023.01.030_bib0001) 2021; 10 Garey (10.1016/j.ejor.2023.01.030_bib0015) 1979 Vidal (10.1016/j.ejor.2023.01.030_bib0029) 2014; 234 Ghaffarian (10.1016/j.ejor.2023.01.030_bib0017) 2019; XLII-2/w13 10.1016/j.ejor.2023.01.030_bib0023 Berman (10.1016/j.ejor.2023.01.030_bib0005) 2002; 29 Drezner (10.1016/j.ejor.2023.01.030_bib0013) 1987; 34 Mukherjee (10.1016/j.ejor.2023.01.030_bib0026) 2002; 83 Blum (10.1016/j.ejor.2023.01.030_bib0007) 2003; 35 Blanquero (10.1016/j.ejor.2023.01.030_bib0006) 2016; 255 Culberson (10.1016/j.ejor.2023.01.030_bib0010) 1988 Vidal (10.1016/j.ejor.2023.01.030_bib0028) 2022; 140 Aupperle (10.1016/j.ejor.2023.01.030_bib0002) 1988 Dupont (10.1016/j.ejor.2023.01.030_bib0014) 2013 Garey (10.1016/j.ejor.2023.01.030_bib0016) 1976; 1 Prins (10.1016/j.ejor.2023.01.030_bib0027) 2004; 31 Megiddo (10.1016/j.ejor.2023.01.030_bib0024) 1984; 13 Jang (10.1016/j.ejor.2023.01.030_bib0019) 2013; 230 Martinez-Sykora (10.1016/j.ejor.2023.01.030_bib0022) 2017; 258 Demiröz (10.1016/j.ejor.2023.01.030_bib0011) 2019; 277 |
| References_xml | – reference: -complete set covering problems. Unpublished manuscript. – volume: 29 start-page: 563 year: 2002 end-page: 581 ident: bib0005 article-title: The generalized maximal covering location problem publication-title: Computers and Operations Research – volume: 1 start-page: 237 year: 1976 end-page: 267 ident: bib0016 article-title: Some simplified publication-title: Theoretical Computer Science – volume: 277 start-page: 62 year: 2019 end-page: 83 ident: bib0011 article-title: Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms publication-title: European Journal of Operational Research – volume: 183 start-page: 1109 year: 2007 end-page: 1130 ident: bib0030 article-title: An improved typology of cutting and packing problems publication-title: European Journal of Operational Research – volume: 38 start-page: 75 year: 2011 end-page: 89 ident: bib0008 article-title: Planar expropriation problem with non-rigid rectangular facilities publication-title: Computers and Operations Research – start-page: 97 year: 1988 end-page: 106 ident: bib0002 article-title: Covering orthogonal polygons with squares publication-title: 26th annual conference on communication, control and computing – volume: 10 start-page: 27l year: 1990 end-page: 275 ident: bib0020 article-title: Packing squares into a square publication-title: Journal of Parallel and Distributed Computing – volume: 32 start-page: 101 year: 1974 end-page: 118 ident: bib0009 article-title: The maximal covering location problem publication-title: Papers of Regional Science Association – volume: 34 start-page: 229 year: 1987 end-page: 234 ident: bib0013 article-title: On the rectangular p-center problem publication-title: Naval Research Logistics – volume: 258 start-page: 440 year: 2017 end-page: 455 ident: bib0022 article-title: Matheuristics for the irregular bin packing problem with free rotations publication-title: European Journal of Operational Research – volume: 54 start-page: 769 year: 2003 end-page: 776 ident: bib0004 article-title: The expropriation location problem publication-title: Journal of the Operational Research Society – start-page: 601 year: 1988 end-page: 611 ident: bib0010 article-title: Covering polygons is hard publication-title: SFCS ’88 proceedings of the 29th annual symposium on foundations of computer science, October 24–26 – volume: 140 start-page: 105643 year: 2022 ident: bib0028 article-title: Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood publication-title: Computers and Operations Research – volume: 45 start-page: 243 year: 2012 end-page: 259 ident: bib0025 article-title: High resolution satellite images for archeological applications: The Karima case study (Nubia region, Sudan) publication-title: European Journal of Remote Sensing – volume: 45 start-page: 294 year: 2012 end-page: 304 ident: bib0003 article-title: The class cover problem with boxes publication-title: Computational Geometry – start-page: 4 year: 2007 ident: bib0021 article-title: Covering points by isothetic unit squares publication-title: Proceedings of the 19th annual canadian conference on computational geometry, CCCG 2007, August 20–22, 2007 – volume: 234 start-page: 658 year: 2014 end-page: 673 ident: bib0029 article-title: A unified solution framework for multi-attribute vehicle routing problems publication-title: European Journal of Operational Research – year: 1979 ident: bib0015 article-title: Computers and intractability: A guide to the theory of – start-page: 442 year: 2013 end-page: 447 ident: bib0014 article-title: Generalized covering location problem with multiple-coverage: Exact and heuristic method publication-title: 7th IFAC conference on manufacturing modelling, management and control, June 19–21 – volume: 10 start-page: 3422 year: 2021 end-page: 3431 ident: bib0001 article-title: Using particle swarm optimization to solve test functions problems publication-title: Bulletin of Electrical Engineering and Informatics – start-page: 94 year: 2021 end-page: 96 ident: bib0018 article-title: Detection and analysis of road information based on optical satellite image publication-title: 2021 international conference on intelligent transportation, big data & smart city (ICITBS) – volume: 255 start-page: 34 year: 2016 end-page: 42 ident: bib0006 article-title: p-facility Huff location problem on networks publication-title: European Journal of Operational Research – volume: 83 start-page: 41 year: 2002 end-page: 48 ident: bib0026 article-title: A polynomial-time optimization algorithm for a rectilinear pratitioning problem with application in VLSI design automation publication-title: Information Processing Letters – volume: XLII-2/w13 start-page: 297 year: 2019 end-page: 302 ident: bib0017 article-title: Towards post-disaster debris identification for precise damage and recovery assessments from UAV and satellite images publication-title: The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences – volume: 230 start-page: 190 year: 2013 end-page: 199 ident: bib0019 article-title: Image collection planning for KOrea multi-purpose SATellite-2 publication-title: European Journal of Operational Research – volume: 13 start-page: 182 year: 1984 end-page: 196 ident: bib0024 article-title: On the complexity of some common geometric location problems publication-title: SIAM Journal on Computing – volume: 31 start-page: 1985 year: 2004 end-page: 2002 ident: bib0027 article-title: A simple and effective evolutionary algorithm for the vehicle routing problem publication-title: Computers and Operations Research – reference: Masek, W. J. (1978). Some – start-page: 10 year: 2020 end-page: 16 ident: bib0012 article-title: The board packing problem: Packing rectangles into a board to maximize profit publication-title: Proceedings of the Pannonian conference on advances in information technology (PCIT 2020) – volume: 35 start-page: 268 year: 2003 end-page: 308 ident: bib0007 article-title: Metaheuristics in combinatorial optimization: Overview and conceptual comparison publication-title: ACM Computing Surveys – volume: 29 start-page: 563 year: 2002 ident: 10.1016/j.ejor.2023.01.030_bib0005 article-title: The generalized maximal covering location problem publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(01)00079-X – volume: 258 start-page: 440 issue: 2 year: 2017 ident: 10.1016/j.ejor.2023.01.030_bib0022 article-title: Matheuristics for the irregular bin packing problem with free rotations publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.09.043 – start-page: 601 year: 1988 ident: 10.1016/j.ejor.2023.01.030_bib0010 article-title: Covering polygons is hard – start-page: 10 year: 2020 ident: 10.1016/j.ejor.2023.01.030_bib0012 article-title: The board packing problem: Packing rectangles into a board to maximize profit – volume: 54 start-page: 769 issue: 7 year: 2003 ident: 10.1016/j.ejor.2023.01.030_bib0004 article-title: The expropriation location problem publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601548 – volume: 255 start-page: 34 issue: 1 year: 2016 ident: 10.1016/j.ejor.2023.01.030_bib0006 article-title: p-facility Huff location problem on networks publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.04.039 – volume: 38 start-page: 75 year: 2011 ident: 10.1016/j.ejor.2023.01.030_bib0008 article-title: Planar expropriation problem with non-rigid rectangular facilities publication-title: Computers and Operations Research doi: 10.1016/j.cor.2010.01.008 – volume: 31 start-page: 1985 issue: 12 year: 2004 ident: 10.1016/j.ejor.2023.01.030_bib0027 article-title: A simple and effective evolutionary algorithm for the vehicle routing problem publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(03)00158-8 – volume: 13 start-page: 182 issue: 1 year: 1984 ident: 10.1016/j.ejor.2023.01.030_bib0024 article-title: On the complexity of some common geometric location problems publication-title: SIAM Journal on Computing doi: 10.1137/0213014 – year: 1979 ident: 10.1016/j.ejor.2023.01.030_bib0015 – volume: 34 start-page: 229 year: 1987 ident: 10.1016/j.ejor.2023.01.030_bib0013 article-title: On the rectangular p-center problem publication-title: Naval Research Logistics doi: 10.1002/1520-6750(198704)34:2<229::AID-NAV3220340207>3.0.CO;2-1 – start-page: 97 year: 1988 ident: 10.1016/j.ejor.2023.01.030_bib0002 article-title: Covering orthogonal polygons with squares – volume: 277 start-page: 62 year: 2019 ident: 10.1016/j.ejor.2023.01.030_bib0011 article-title: Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.02.004 – volume: 10 start-page: 27l issue: 3 year: 1990 ident: 10.1016/j.ejor.2023.01.030_bib0020 article-title: Packing squares into a square publication-title: Journal of Parallel and Distributed Computing doi: 10.1016/0743-7315(90)90019-L – volume: 234 start-page: 658 year: 2014 ident: 10.1016/j.ejor.2023.01.030_bib0029 article-title: A unified solution framework for multi-attribute vehicle routing problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.09.045 – volume: 45 start-page: 243 issue: 1 year: 2012 ident: 10.1016/j.ejor.2023.01.030_bib0025 article-title: High resolution satellite images for archeological applications: The Karima case study (Nubia region, Sudan) publication-title: European Journal of Remote Sensing doi: 10.5721/EuJRS20124522 – volume: 230 start-page: 190 year: 2013 ident: 10.1016/j.ejor.2023.01.030_bib0019 article-title: Image collection planning for KOrea multi-purpose SATellite-2 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.04.009 – ident: 10.1016/j.ejor.2023.01.030_bib0023 – volume: 10 start-page: 3422 issue: 6 year: 2021 ident: 10.1016/j.ejor.2023.01.030_bib0001 article-title: Using particle swarm optimization to solve test functions problems publication-title: Bulletin of Electrical Engineering and Informatics doi: 10.11591/eei.v10i6.3244 – volume: 140 start-page: 105643 year: 2022 ident: 10.1016/j.ejor.2023.01.030_bib0028 article-title: Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood publication-title: Computers and Operations Research doi: 10.1016/j.cor.2021.105643 – volume: 32 start-page: 101 year: 1974 ident: 10.1016/j.ejor.2023.01.030_bib0009 article-title: The maximal covering location problem publication-title: Papers of Regional Science Association doi: 10.1111/j.1435-5597.1974.tb00902.x – volume: 45 start-page: 294 issue: 7 year: 2012 ident: 10.1016/j.ejor.2023.01.030_bib0003 article-title: The class cover problem with boxes publication-title: Computational Geometry doi: 10.1016/j.comgeo.2012.01.014 – start-page: 442 year: 2013 ident: 10.1016/j.ejor.2023.01.030_bib0014 article-title: Generalized covering location problem with multiple-coverage: Exact and heuristic method – start-page: 94 year: 2021 ident: 10.1016/j.ejor.2023.01.030_bib0018 article-title: Detection and analysis of road information based on optical satellite image – volume: XLII-2/w13 start-page: 297 year: 2019 ident: 10.1016/j.ejor.2023.01.030_bib0017 article-title: Towards post-disaster debris identification for precise damage and recovery assessments from UAV and satellite images publication-title: The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences doi: 10.5194/isprs-archives-XLII-2-W13-297-2019 – volume: 1 start-page: 237 issue: 3 year: 1976 ident: 10.1016/j.ejor.2023.01.030_bib0016 article-title: Some simplified NP-complete graph problems publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(76)90059-1 – volume: 183 start-page: 1109 issue: 3 year: 2007 ident: 10.1016/j.ejor.2023.01.030_bib0030 article-title: An improved typology of cutting and packing problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.12.047 – volume: 83 start-page: 41 year: 2002 ident: 10.1016/j.ejor.2023.01.030_bib0026 article-title: A polynomial-time optimization algorithm for a rectilinear pratitioning problem with application in VLSI design automation publication-title: Information Processing Letters doi: 10.1016/S0020-0190(01)00305-2 – volume: 35 start-page: 268 issue: 3 year: 2003 ident: 10.1016/j.ejor.2023.01.030_bib0007 article-title: Metaheuristics in combinatorial optimization: Overview and conceptual comparison publication-title: ACM Computing Surveys doi: 10.1145/937503.937505 – start-page: 4 year: 2007 ident: 10.1016/j.ejor.2023.01.030_bib0021 article-title: Covering points by isothetic unit squares |
| SSID | ssj0001515 |
| Score | 2.4424455 |
| Snippet | •The board packing problem (BoPP) is introduced.•BoPP subsumes several natural optimization problems that arise in practice.•We prove that BoPP is NP-hard by... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1056 |
| SubjectTerms | Binary integer programming Combinatorial optimization Covering Genetic algorithm Location problems |
| Title | The board packing problem |
| URI | https://dx.doi.org/10.1016/j.ejor.2023.01.030 |
| Volume | 308 |
| WOSCitedRecordID | wos000957431800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwED_BhtB44KOAVr6UB96qTIlNYuexgsFAYyBRUN-i2LGnlSqZ2nQa_z3n-JIFGBMg8RJVVu0md79efnf23QE815LFKhEsVEyb8EWh8C8VJTaMSlMwkUYlb7PevxyKoyM5n2cfKaq0btsJiKqS5-fZ6X9VNY6hsl3q7F-ou18UB_AzKh2vqHa8_rHiVe2iA-gOf_XJ5m3TmN8G4YmQ4sCqCw1SDaA-VjxVfUb1m2-bZW_LX9Xrwg_Wq4vo_MFZ0TS-gfIhOs6T98VxtenJ-4dl0W4ZzdzRpMm0aU5oPQo-MN4ffaOI2C9ZMT4TS4iQMZ-TuWe8YZWIh1T63gGd5eWRHECMD-wosr508E5GH5Vfau996GGxZxa1K-7KeFuDlXZ6fqyj_cndlrsrdLqcXySvwzYTSYamcHv6dn_-rn-BO47Xbj7RY1CulT8W-PMvXc5nBhxldhduk3MRTD0o7sE1U43gZpfbMII7XQ-PgEz6CG4NClLehzGCJ2jBExB4AgLPA_j8en_28iCk5hmhRpe9CQXTKVOZ5uiSZkbGNi6RvClW6pgnkZFKIZG3VpdWZYZZoWJk5iiORLHUGin5Q9iq6srsQmC1zGyC0zkuFvNSlYkoC4GOg0V2Z9UY4k4EuabK8q7ByTLvjhAucie23Iktj-IcxTaGST_n1NdVufLbSSfZnJihZ3w5AuGKeY_-cd5j2LlA-xPYalYb8xRu6LPmZL16Rnj5DurEhFk |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+board+packing+problem&rft.jtitle=European+journal+of+operational+research&rft.au=Abraham%2C+Gyula&rft.au=Dosa%2C+Gyorgy&rft.au=Hvattum%2C+Lars+Magnus&rft.au=Olaj%2C+Tomas+Attila&rft.date=2023-08-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=308&rft.issue=3&rft.spage=1056&rft.epage=1073&rft_id=info:doi/10.1016%2Fj.ejor.2023.01.030&rft.externalDocID=S0377221723000498 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |