{"id":"https://openalex.org/W4382866716","doi":"https://doi.org/10.1609/icaps.v33i1.27213","title":"A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem","display_name":"A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem","alternate_titles":[],"publication_year":2023,"publication_date":"2023-07-01","ids":{"openalex":"https://openalex.org/W4382866716","doi":"https://doi.org/10.1609/icaps.v33i1.27213"},"language":"en","primary_location":{"id":"doi:10.1609/icaps.v33i1.27213","doi":"https://doi.org/10.1609/icaps.v33i1.27213","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v33i1.27213","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/27213/26986","source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1"],"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W4382866716"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/27213/26986","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082401107","display_name":"Sergey Polyakovskiy","orcid":"https://orcid.org/0000-0001-9489-1972","observed_orcids":["https://orcid.org/0000-0001-9489-1972"]},"institutions":[{"id":"https://openalex.org/I149704539","display_name":"Deakin University","ror":"https://ror.org/02czsnj07","country_code":"AU","type":"education","lineage":["https://openalex.org/I149704539"]}],"countries":["AU"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Sergey Polyakovskiy","raw_affiliation_strings":["School of Information Technology, Deakin University, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technology, Deakin University, Australia","institution_ids":["https://openalex.org/I149704539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064839018","display_name":"Peter J. Stuckey","orcid":"https://orcid.org/0000-0003-2186-0459","observed_orcids":["https://orcid.org/0000-0003-2186-0459"]},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Peter J. Stuckey","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Australia\nOPTIMA ARC Industrial Training and Transformation Center, Melbourne Connect, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Australia\nOPTIMA ARC Industrial Training and Transformation Center, Melbourne Connect, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9516,"has_fulltext":true,"cited_by_count":6,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.86670344,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":92,"max":98},"biblio":{"volume":"33","issue":"1","first_page":"352","last_page":"360"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/guillotine-cutting","display_name":"guillotine cutting","score":0.7730000019073486},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"constraint programming","score":0.8510000109672546},{"id":"https://openalex.org/keywords/guillotine-cuts","display_name":"guillotine cuts","score":0.7630000114440918},{"id":"https://openalex.org/keywords/profit-maximization","display_name":"profit maximization","score":0.7739999890327454},{"id":"https://openalex.org/keywords/mixed-integer-linear-programming-comparison","display_name":"mixed-integer linear programming comparison","score":0.796999990940094},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"cutting stock problem","score":0.460999995470047}],"concepts":[{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5995187759399414},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5624023079872131},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5502597689628601},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5085786581039429},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5069763660430908},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.5037609934806824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5033490061759949},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.42574164271354675},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4122953712940216},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39004307985305786},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.21605530381202698},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13367542624473572},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.09700208902359009},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0880352258682251},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/icaps.v33i1.27213","doi":"https://doi.org/10.1609/icaps.v33i1.27213","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v33i1.27213","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/27213/26986","source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1"],"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:figshare.com:article/24024441","doi":null,"is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/A_Constraint_Programming_Solution_to_the_Guillotine_Rectangular_Cutting_Problem/24024441","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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":null,"raw_type":"Conference contribution"}],"best_oa_location":{"id":"doi:10.1609/icaps.v33i1.27213","doi":"https://doi.org/10.1609/icaps.v33i1.27213","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v33i1.27213","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/27213/26986","source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1"],"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4382866716.pdf","grobid_xml":"https://content.openalex.org/works/W4382866716.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1969716703","https://openalex.org/W1983333862","https://openalex.org/W2018182024","https://openalex.org/W2042784190","https://openalex.org/W2049791651","https://openalex.org/W2055991662","https://openalex.org/W2095219480","https://openalex.org/W2105175235","https://openalex.org/W2136790460","https://openalex.org/W2140631835","https://openalex.org/W2148404167","https://openalex.org/W2152147252","https://openalex.org/W2155839396","https://openalex.org/W2248593987","https://openalex.org/W2519499514","https://openalex.org/W2529499916","https://openalex.org/W2884579014","https://openalex.org/W3018201020","https://openalex.org/W3042572764","https://openalex.org/W3094208825","https://openalex.org/W3207862177","https://openalex.org/W4291183979","https://openalex.org/W4293203540"],"related_works":["https://openalex.org/W4415390323","https://openalex.org/W4291183979","https://openalex.org/W2989673531","https://openalex.org/W3094208825","https://openalex.org/W2989215083","https://openalex.org/W2529499916","https://openalex.org/W2002879344","https://openalex.org/W1969732427","https://openalex.org/W2381558016","https://openalex.org/W1983333862"],"abstract_inverted_index":{"The":[0,36,61],"guillotine":[1,62,74,97,110,119,147],"rectangular":[2,9,18,126],"cutting":[3,98,177],"problem":[4,37],"deals":[5],"with":[6,30,99,128],"a":[7,15,31,34,40,44,88,122,140,182,195,201],"single":[8],"plate":[10,50,138],"of":[11,17,43,46,58,83,103,105,125,171,175,197,203],"raw":[12],"material":[13],"and":[14,33,108,143,205,210],"collection":[16],"items":[19,47],"to":[20,53,67,80,132,150,185],"be":[21,71],"cut":[22],"from":[23],"the":[24,49,55,84,136,146,152,160,164,166,169,176],"plate.":[25,85],"Each":[26],"item":[27],"is":[28,94,113,181],"associated":[29],"profit":[32,57],"demand.":[35],"searches":[38],"for":[39,96,159,213,219],"feasible":[41,65],"layout":[42],"subset":[45],"on":[48,145,200],"so":[51],"as":[52,139],"maximize":[54],"total":[56],"selected":[59],"items.":[60,133,161],"constraint":[63,90],"restricts":[64],"layouts":[66],"those":[68],"that":[69,77,93,117,216],"can":[70],"obtained":[72],"via":[73],"edge-to-edge":[75],"cuts":[76,120,148],"run":[78],"parallel":[79],"an":[81,100,114],"edge":[82],"We":[86],"propose":[87],"novel":[89],"programming":[91,190],"model":[92,116,167,180],"suitable":[95],"arbitrary":[101],"number":[102,124,196],"stages":[104],"alternating":[106],"horizontal":[107],"vertical":[109],"cuts.":[111],"This":[112],"assignment-based":[115],"models":[118],"using":[121],"constant":[123],"regions,":[127],"some":[129],"regions":[130,153],"allocated":[131],"It":[134,193],"treats":[135],"entire":[137],"primary":[141],"region":[142],"decides":[144],"required":[149],"split":[151],"recursively":[154],"till":[155],"they":[156],"produce":[157],"space":[158],"To":[162],"speed":[163],"search,":[165],"explores":[168],"strength":[170],"cumulative":[172],"scheduling":[173],"relaxations":[174],"problem.":[178],"Our":[179],"successful":[183],"alternative":[184],"more":[186],"traditional":[187],"mixed-integer":[188],"linear":[189],"(MILP)":[191],"models.":[192],"outperforms":[194],"state-of-the-art":[198],"MILPs":[199],"set":[202],"small":[204],"moderate":[206],"size":[207],"benchmark":[208],"instances":[209,215],"proves":[211],"optimality":[212],"several":[214],"remain":[217],"challenging":[218],"these":[220],"MILPs.":[221]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4382866716","counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":2}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2023-07-02T00:00:00"}
