{"id":"https://openalex.org/W4280520414","doi":"https://doi.org/10.3390/a15050164","title":"A Parallelizable Integer Linear Programming Approach for Tiling Finite Regions of the Plane with Polyominoes","display_name":"A Parallelizable Integer Linear Programming Approach for Tiling Finite Regions of the Plane with Polyominoes","publication_year":2022,"publication_date":"2022-05-12","ids":{"openalex":"https://openalex.org/W4280520414","doi":"https://doi.org/10.3390/a15050164"},"language":"en","primary_location":{"id":"doi:10.3390/a15050164","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15050164","pdf_url":"https://www.mdpi.com/1999-4893/15/5/164/pdf?version=1652793418","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/5/164/pdf?version=1652793418","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067562365","display_name":"Marcus R. Garvie","orcid":"https://orcid.org/0000-0002-4980-0514"},"institutions":[{"id":"https://openalex.org/I79817857","display_name":"University of Guelph","ror":"https://ror.org/01r7awg59","country_code":"CA","type":"education","lineage":["https://openalex.org/I79817857"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Marcus R. Garvie","raw_affiliation_strings":["Department of Mathematics & Statistics, University of Guelph, Guelph, ON N1G 2W1, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics & Statistics, University of Guelph, Guelph, ON N1G 2W1, Canada","institution_ids":["https://openalex.org/I79817857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024090165","display_name":"John Burkardt","orcid":"https://orcid.org/0000-0003-0273-2769"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Burkardt","raw_affiliation_strings":["Department of Mathematics, University of Pittsburgh, Pittsburgh, PA 15260, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Pittsburgh, Pittsburgh, PA 15260, USA","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067562365"],"corresponding_institution_ids":["https://openalex.org/I79817857"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.604,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.66098884,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"15","issue":"5","first_page":"164","last_page":"164"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14339","display_name":"Image Processing and 3D Reconstruction","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T14339","display_name":"Image Processing and 3D Reconstruction","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9416000247001648,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.8416150808334351},{"id":"https://openalex.org/keywords/polyomino","display_name":"Polyomino","score":0.7747822999954224},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5737546682357788},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5641988515853882},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5505698323249817},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5195579528808594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.457487016916275},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4157869815826416},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35650530457496643},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3431069850921631},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.20487159490585327},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.1045399010181427},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07159155607223511}],"concepts":[{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.8416150808334351},{"id":"https://openalex.org/C69919132","wikidata":"https://www.wikidata.org/wiki/Q1144819","display_name":"Polyomino","level":3,"score":0.7747822999954224},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5737546682357788},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5641988515853882},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5505698323249817},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5195579528808594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.457487016916275},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4157869815826416},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35650530457496643},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3431069850921631},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.20487159490585327},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.1045399010181427},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07159155607223511},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a15050164","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15050164","pdf_url":"https://www.mdpi.com/1999-4893/15/5/164/pdf?version=1652793418","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:141976afddac4945a2db125365321a05","is_oa":true,"landing_page_url":"https://doaj.org/article/141976afddac4945a2db125365321a05","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 5, p 164 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/5/164/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15050164","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 5; Pages: 164","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15050164","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15050164","pdf_url":"https://www.mdpi.com/1999-4893/15/5/164/pdf?version=1652793418","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4280520414.pdf","grobid_xml":"https://content.openalex.org/works/W4280520414.grobid-xml"},"referenced_works_count":59,"referenced_works":["https://openalex.org/W82127606","https://openalex.org/W206619899","https://openalex.org/W576907608","https://openalex.org/W1575764817","https://openalex.org/W1965407967","https://openalex.org/W1968163400","https://openalex.org/W1980486012","https://openalex.org/W1992101337","https://openalex.org/W2007385106","https://openalex.org/W2011069339","https://openalex.org/W2014766535","https://openalex.org/W2017025480","https://openalex.org/W2022592602","https://openalex.org/W2023756508","https://openalex.org/W2035698628","https://openalex.org/W2038021690","https://openalex.org/W2039275622","https://openalex.org/W2042413448","https://openalex.org/W2046190636","https://openalex.org/W2047075079","https://openalex.org/W2049930558","https://openalex.org/W2055590727","https://openalex.org/W2058174631","https://openalex.org/W2070622420","https://openalex.org/W2080042417","https://openalex.org/W2082757220","https://openalex.org/W2085794924","https://openalex.org/W2103874366","https://openalex.org/W2119324012","https://openalex.org/W2129495578","https://openalex.org/W2130944005","https://openalex.org/W2131997539","https://openalex.org/W2137342394","https://openalex.org/W2154815812","https://openalex.org/W2161156055","https://openalex.org/W2180937758","https://openalex.org/W2295268496","https://openalex.org/W2322299034","https://openalex.org/W2323835604","https://openalex.org/W2327692812","https://openalex.org/W2557754243","https://openalex.org/W2964333087","https://openalex.org/W3103323145","https://openalex.org/W3192837153","https://openalex.org/W4205965692","https://openalex.org/W4206570602","https://openalex.org/W4206807714","https://openalex.org/W4212792388","https://openalex.org/W4214556156","https://openalex.org/W4233036870","https://openalex.org/W4234442392","https://openalex.org/W4234632139","https://openalex.org/W4243418108","https://openalex.org/W4293179730","https://openalex.org/W4400596849","https://openalex.org/W6654663888","https://openalex.org/W6668659698","https://openalex.org/W6780167222","https://openalex.org/W6967576715"],"related_works":["https://openalex.org/W4288734188","https://openalex.org/W209156724","https://openalex.org/W2135008840","https://openalex.org/W4213044019","https://openalex.org/W148666007","https://openalex.org/W2103874366","https://openalex.org/W2572231869","https://openalex.org/W2962715651","https://openalex.org/W2046419983","https://openalex.org/W4280520414"],"abstract_inverted_index":{"The":[0,94,133,147,211],"general":[1],"problem":[2,20],"of":[3,7,44,58,127,129,198,213],"tiling":[4,35,49,91,100,162,178],"finite":[5],"regions":[6],"the":[8,16,28,59,177,224],"plane":[9],"with":[10,50,81,92,164],"polyominoes":[11,51],"is":[12,36,55,136],"NP-complete,":[13],"and":[14,38,122,191,200,218],"so":[15],"associated":[17],"computational":[18],"geometry":[19],"rapidly":[21],"becomes":[22],"intractable":[23],"for":[24,34,63,90,159,230],"large":[25,99,161],"instances.":[26],"Thus,":[27],"need":[29],"to":[30,48,68,116,137,188,222],"reduce":[31],"algorithm":[32],"complexity":[33],"important":[37],"continues":[39],"as":[40,107],"a":[41,56,69,82,108,130,143,156,170,196,202],"fruitful":[42],"area":[43],"research.":[45],"Traditional":[46],"approaches":[47],"use":[52],"backtracking,":[53],"which":[54],"refinement":[57],"\u2018brute-force\u2019":[60],"solution":[61],"procedure":[62],"exhaustively":[64],"finding":[65,160],"all":[66],"solutions":[67,163],"combinatorial":[70],"search":[71],"problem.":[72,111],"In":[73],"this":[74,117,140],"work,":[75],"we":[76,168],"combine":[77],"checkerboard":[78],"colouring":[79,95,149,185],"techniques":[80],"recently":[83],"introduced":[84],"integer":[85],"linear":[86],"programming":[87],"(ILP)":[88],"technique":[89,150,186],"polyominoes.":[93],"arguments":[96],"often":[97],"split":[98],"problems":[101,179,226],"into":[102],"smaller":[103],"subproblems,":[104],"each":[105],"represented":[106],"separate":[109],"ILP":[110,209,225],"Problems":[112],"that":[113,180,206],"are":[114,119,227],"amenable":[115],"approach":[118,141],"embarrassingly":[120],"parallel,":[121],"our":[123,184],"work":[124],"provides":[125],"proof":[126],"concept":[128],"parallelizable":[131],"algorithm.":[132],"main":[134],"goal":[135],"analyze":[138],"when":[139,167],"yields":[142],"potential":[144],"parallel":[145,157],"speedup.":[146],"novel":[148],"shows":[151],"excellent":[152],"promise":[153],"in":[154],"yielding":[155],"speedup":[158],"ILP,":[165],"particularly":[166],"seek":[169],"single":[171],"(optimal)":[172],"solution.":[173],"We":[174],"also":[175],"classify":[176],"result":[181],"from":[182],"applying":[183],"according":[187],"different":[189],"criteria":[190],"compute":[192],"representative":[193],"examples":[194],"using":[195],"combination":[197],"MATLAB":[199,214],"CPLEX,":[201],"commercial":[203],"optimization":[204],"package":[205],"can":[207],"solve":[208],"problems.":[210],"collections":[212],"programs":[215],"PARIOMINOES":[216],"(v3.0.0)":[217],"POLYOMINOES":[219],"(v2.1.4)":[220],"used":[221],"construct":[223],"freely":[228],"available":[229],"download.":[231]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}