{"id":"https://openalex.org/W2804571018","doi":"https://doi.org/10.1007/s13675-019-00113-9","title":"Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers","display_name":"Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers","publication_year":2019,"publication_date":"2019-05-10","ids":{"openalex":"https://openalex.org/W2804571018","doi":"https://doi.org/10.1007/s13675-019-00113-9","mag":"2804571018"},"language":"en","primary_location":{"id":"doi:10.1007/s13675-019-00113-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-019-00113-9","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s13675-019-00113-9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039674040","display_name":"Fran\u00e7ois Clautiaux","orcid":"https://orcid.org/0000-0002-9171-8012"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["AT","FR"],"is_corresponding":false,"raw_author_name":"Fran\u00e7ois Clautiaux","raw_affiliation_strings":["IMB, Universit\u00e9 de Bordeaux, 351 cours de la Lib\u00e9ration, 33405, Talence, France","Reformulations based algorithms for Combinatorial Optimization","Universit\u00e9 de Bordeaux"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMB, Universit\u00e9 de Bordeaux, 351 cours de la Lib\u00e9ration, 33405, Talence, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210166017"]},{"raw_affiliation_string":"Reformulations based algorithms for Combinatorial Optimization","institution_ids":["https://openalex.org/I4210099593"]},{"raw_affiliation_string":"Universit\u00e9 de Bordeaux","institution_ids":["https://openalex.org/I15057530"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091714809","display_name":"Ruslan Sadykov","orcid":"https://orcid.org/0000-0002-4862-2226"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I4210131512","display_name":"Centre Inria de l'universit\u00e9 de Bordeaux","ror":"https://ror.org/03tjcj052","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210131512"]},{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["AT","FR"],"is_corresponding":true,"raw_author_name":"Ruslan Sadykov","raw_affiliation_strings":["IMB, Universit\u00e9 de Bordeaux, 351 cours de la Lib\u00e9ration, 33405, Talence, France","INRIA Bordeaux - Sud-Ouest, 200 avenue de la Vieille Tour, 33405, Talence, France","Reformulations based algorithms for Combinatorial Optimization"],"raw_orcid":"https://orcid.org/0000-0002-4862-2226","affiliations":[{"raw_affiliation_string":"IMB, Universit\u00e9 de Bordeaux, 351 cours de la Lib\u00e9ration, 33405, Talence, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210166017"]},{"raw_affiliation_string":"INRIA Bordeaux - Sud-Ouest, 200 avenue de la Vieille Tour, 33405, Talence, France","institution_ids":["https://openalex.org/I4210131512"]},{"raw_affiliation_string":"Reformulations based algorithms for Combinatorial Optimization","institution_ids":["https://openalex.org/I4210099593"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011840668","display_name":"Fran\u00e7ois Vanderbeck","orcid":"https://orcid.org/0000-0001-5791-7053"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["AT","FR"],"is_corresponding":false,"raw_author_name":"Fran\u00e7ois Vanderbeck","raw_affiliation_strings":["IMB, Universit\u00e9 de Bordeaux, 351 cours de la Lib\u00e9ration, 33405, Talence, France","Reformulations based algorithms for Combinatorial Optimization","Universit\u00e9 de Bordeaux"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMB, Universit\u00e9 de Bordeaux, 351 cours de la Lib\u00e9ration, 33405, Talence, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210166017"]},{"raw_affiliation_string":"Reformulations based algorithms for Combinatorial Optimization","institution_ids":["https://openalex.org/I4210099593"]},{"raw_affiliation_string":"Universit\u00e9 de Bordeaux","institution_ids":["https://openalex.org/I15057530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090175400","display_name":"Quentin Viaud","orcid":null},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["AT","FR"],"is_corresponding":false,"raw_author_name":"Quentin Viaud","raw_affiliation_strings":["IMB, Universit\u00e9 de Bordeaux, 351 cours de la Lib\u00e9ration, 33405, Talence, France","Reformulations based algorithms for Combinatorial Optimization","Universit\u00e9 de Bordeaux"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMB, Universit\u00e9 de Bordeaux, 351 cours de la Lib\u00e9ration, 33405, Talence, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210166017"]},{"raw_affiliation_string":"Reformulations based algorithms for Combinatorial Optimization","institution_ids":["https://openalex.org/I4210099593"]},{"raw_affiliation_string":"Universit\u00e9 de Bordeaux","institution_ids":["https://openalex.org/I15057530"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091714809"],"corresponding_institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210099593","https://openalex.org/I4210131512","https://openalex.org/I4210166017"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":2.0532,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.88138829,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"7","issue":"3","first_page":"265","last_page":"297"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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":0.9998999834060669,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9937000274658203,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9912999868392944,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7852826714515686},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.687924861907959},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.6636365652084351},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6125690937042236},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.592312216758728},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5704077482223511},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5549967288970947},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5061904788017273},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4549696743488312},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.44040441513061523},{"id":"https://openalex.org/keywords/purchasing","display_name":"Purchasing","score":0.41610950231552124},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3179277777671814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28925836086273193},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.25443005561828613},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.16021955013275146},{"id":"https://openalex.org/keywords/operations-management","display_name":"Operations management","score":0.14469963312149048}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7852826714515686},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.687924861907959},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.6636365652084351},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6125690937042236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.592312216758728},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5704077482223511},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5549967288970947},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5061904788017273},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4549696743488312},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.44040441513061523},{"id":"https://openalex.org/C2778813691","wikidata":"https://www.wikidata.org/wiki/Q1369832","display_name":"Purchasing","level":2,"score":0.41610950231552124},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3179277777671814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28925836086273193},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25443005561828613},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.16021955013275146},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.14469963312149048},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s13675-019-00113-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-019-00113-9","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01656179v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01656179","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"EURO Journal on Computational Optimization, 2019, 7 (3), pp.265-297. ⟨10.1007/s13675-019-00113-9⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:spr:eurjco:v:7:y:2019:i:3:d:10.1007_s13675-019-00113-9","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s13675-019-00113-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:doaj.org/article:6537fed784134269ab6d6f6bb13a340e","is_oa":true,"landing_page_url":"https://doaj.org/article/6537fed784134269ab6d6f6bb13a340e","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"EURO Journal on Computational Optimization, Vol 7, Iss 3, Pp 265-297 (2019)","raw_type":"article"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/193473","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/193473","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/9951","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/9951","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":{"id":"doi:10.1007/s13675-019-00113-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-019-00113-9","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W122670924","https://openalex.org/W1560446172","https://openalex.org/W1570631094","https://openalex.org/W1963555229","https://openalex.org/W1983333862","https://openalex.org/W1993974091","https://openalex.org/W2015238666","https://openalex.org/W2015368683","https://openalex.org/W2022238601","https://openalex.org/W2036267200","https://openalex.org/W2036652785","https://openalex.org/W2044897000","https://openalex.org/W2045250369","https://openalex.org/W2058056194","https://openalex.org/W2060747552","https://openalex.org/W2074821977","https://openalex.org/W2076474300","https://openalex.org/W2078681980","https://openalex.org/W2082836978","https://openalex.org/W2099303096","https://openalex.org/W2152891233","https://openalex.org/W2153774705","https://openalex.org/W2159376627","https://openalex.org/W2171728005","https://openalex.org/W2529499916","https://openalex.org/W2597346146","https://openalex.org/W2622743854","https://openalex.org/W2625859466"],"related_works":["https://openalex.org/W2911906655","https://openalex.org/W2015368683","https://openalex.org/W1556053881","https://openalex.org/W4392388321","https://openalex.org/W2992612773","https://openalex.org/W2588840994","https://openalex.org/W138645787","https://openalex.org/W2800285872","https://openalex.org/W2152891233","https://openalex.org/W2333099971"],"abstract_inverted_index":{"In":[0,87],"the":[1,6,11,55,60,72,93,96,103,107,122,149,156,171,180,186,190,196,205,208,212,225,244],"two-dimensional":[2],"guillotine":[3],"cutting-stock":[4],"problem,":[5,30,95],"objective":[7,97],"is":[8,100,125,176],"to":[9,17,101,154,160,178,239],"minimize":[10,102],"number":[12,181],"of":[13,21,28,39,64,98,106,148,182,189,207,243],"large":[14,56],"plates":[15],"used":[16],"cut":[18],"a":[19,26,65,113,144],"list":[20],"small":[22],"rectangles.":[23],"We":[24,111,151,168],"consider":[25],"variant":[27],"this":[29,88,161],"which":[31,67,99,121,175],"arises":[32],"in":[33,59,120,143,185],"glass":[34,235],"industry":[35,236],"when":[36],"different":[37],"bills":[38],"order":[40],"(or":[41],"batches)":[42],"are":[43,51,217],"considered":[44],"consecutively.":[45],"For":[46],"practical":[47],"organization":[48],"reasons,":[49],"leftovers":[50],"not":[52],"reused,":[53],"except":[54],"one":[57],"obtained":[58,199],"last":[61],"cutting":[62,108,138],"pattern":[63],"batch,":[66],"can":[68,77],"be":[69,78],"reused":[70],"for":[71,84],"next":[73],"batch.":[74,86],"The":[75],"problem":[76,83,124],"decomposed":[79],"into":[80],"an":[81],"independent":[82],"each":[85],"paper,":[89],"we":[90],"focus":[91],"on":[92,117,221,230],"one-batch":[94],"total":[104],"width":[105],"patterns":[109,139,184],"used.":[110],"propose":[112],"diving":[114,158,213,246],"heuristic":[115,159,247],"based":[116],"column":[118,201],"generation,":[119],"pricing":[123],"solved":[126],"using":[127],"dynamic":[128,191],"programming":[129],"(DP).":[130],"This":[131,193],"DP":[132],"generates":[133],"so-called":[134],"non-proper":[135,183],"columns,":[136],"i.e.":[137],"that":[140],"cannot":[141],"participate":[142],"feasible":[145],"integer":[146],"solution":[147,187],"problem.":[150],"show":[152],"how":[153],"adapt":[155],"standard":[157],"\u201cnon-proper\u201d":[162],"case":[163],"while":[164],"keeping":[165],"its":[166],"effectiveness.":[167],"also":[169],"introduce":[170],"partial":[172],"enumeration":[173],"technique,":[174],"designed":[177],"reduce":[179],"space":[188],"program.":[192],"technique":[194],"strengthens":[195],"lower":[197],"bounds":[198],"by":[200,211],"generation":[202],"and":[203,219,250],"improves":[204],"quality":[206],"solutions":[209],"found":[210],"heuristic.":[214],"Computational":[215],"results":[216],"reported":[218],"compared":[220],"classical":[222],"benchmarks":[223],"from":[224,234],"literature":[226],"as":[227,229],"well":[228],"new":[231],"instances":[232],"inspired":[233],"data.":[237],"According":[238],"these":[240],"results,":[241],"variants":[242],"proposed":[245],"outperform":[248],"constructive":[249],"evolutionary":[251],"heuristics.":[252]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}