{"id":"https://openalex.org/W7116789795","doi":"https://doi.org/10.1007/s10601-025-09382-1","title":"Solving logic-based benders decomposition master problems with constraint programming and domain-independent dynamic programming","display_name":"Solving logic-based benders decomposition master problems with constraint programming and domain-independent dynamic programming","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W7116789795","doi":"https://doi.org/10.1007/s10601-025-09382-1"},"language":"en","primary_location":{"id":"doi:10.1007/s10601-025-09382-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10601-025-09382-1","pdf_url":null,"source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"is_oa":false,"is_in_doaj":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Constraints","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056916482","display_name":"Jiachen Zhang","orcid":"https://orcid.org/0000-0002-3305-4983"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Jiachen Zhang","raw_affiliation_strings":["Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5121001777","display_name":"J. Christopher Beck","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. Christopher Beck","raw_affiliation_strings":["Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056916482"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.64868934,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"1-4","first_page":"62","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","score":0.6496000289916992,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.6496000289916992,"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.07090000063180923,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10142","display_name":"Formal Methods in Verification","score":0.06589999794960022,"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/dynamic-programming","display_name":"Dynamic programming","score":0.6265000104904175},{"id":"https://openalex.org/keywords/benders-decomposition","display_name":"Benders' decomposition","score":0.6226000189781189},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6175000071525574},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5759999752044678},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5418999791145325},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5364999771118164},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5005000233650208},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4984000027179718},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.48350000381469727}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6355000138282776},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6265000104904175},{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.6226000189781189},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6175000071525574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5968000292778015},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5759999752044678},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5418999791145325},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5364999771118164},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5005000233650208},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4984000027179718},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.48350000381469727},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4684000015258789},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4404999911785126},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.38350000977516174},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.37689998745918274},{"id":"https://openalex.org/C129537906","wikidata":"https://www.wikidata.org/wiki/Q7603913","display_name":"State variable","level":2,"score":0.350600004196167},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.34439998865127563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3334999978542328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32839998602867126},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.32690000534057617},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.32589998841285706},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.31779998540878296},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.31679999828338623},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3160000145435333},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.30979999899864197},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3091000020503998},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.28780001401901245},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.257999986410141}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10601-025-09382-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10601-025-09382-1","pdf_url":null,"source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"is_oa":false,"is_in_doaj":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Constraints","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W132857504","https://openalex.org/W181821166","https://openalex.org/W1483918358","https://openalex.org/W1487460562","https://openalex.org/W1508945008","https://openalex.org/W1856880495","https://openalex.org/W1972351035","https://openalex.org/W1977474885","https://openalex.org/W1978892650","https://openalex.org/W2001749313","https://openalex.org/W2038323738","https://openalex.org/W2057798351","https://openalex.org/W2059020966","https://openalex.org/W2089846192","https://openalex.org/W2094721569","https://openalex.org/W2117401085","https://openalex.org/W2124947072","https://openalex.org/W2139824765","https://openalex.org/W2151720296","https://openalex.org/W2156150807","https://openalex.org/W2169427658","https://openalex.org/W2255734301","https://openalex.org/W2259014205","https://openalex.org/W2341338378","https://openalex.org/W2395529118","https://openalex.org/W2560324934","https://openalex.org/W2725862116","https://openalex.org/W2944047065","https://openalex.org/W2963734638","https://openalex.org/W3085049663","https://openalex.org/W3095613678","https://openalex.org/W3138932436","https://openalex.org/W3186848235","https://openalex.org/W4214479678","https://openalex.org/W4241289801","https://openalex.org/W4361003883","https://openalex.org/W4380609585","https://openalex.org/W4382866847","https://openalex.org/W4382866853","https://openalex.org/W4385336248","https://openalex.org/W4401810773","https://openalex.org/W4403099496"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-12-22T00:00:00"}