{"id":"https://openalex.org/W4414117764","doi":"https://doi.org/10.1109/ccta53793.2025.11151400","title":"A GPU-Aware Batched Branch and Bound Method for Solving Mixed-Binary MPC Problems","display_name":"A GPU-Aware Batched Branch and Bound Method for Solving Mixed-Binary MPC Problems","publication_year":2025,"publication_date":"2025-08-25","ids":{"openalex":"https://openalex.org/W4414117764","doi":"https://doi.org/10.1109/ccta53793.2025.11151400"},"language":"en","primary_location":{"id":"doi:10.1109/ccta53793.2025.11151400","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccta53793.2025.11151400","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Conference on Control Technology and Applications (CCTA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/84a7c473-4fc9-46d5-afe3-861e2402c54d","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012841379","display_name":"P. C. N. Verheijen","orcid":"https://orcid.org/0009-0003-2269-4066"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"P. C. N. Verheijen","raw_affiliation_strings":["Eindhoven University of Technology,Department of Electrical Engineering,The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Department of Electrical Engineering,The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043683923","display_name":"Mahmoud Samir El-kady","orcid":"https://orcid.org/0000-0003-1324-6598"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"M. Elkady","raw_affiliation_strings":["Eindhoven University of Technology,Department of Electrical Engineering,The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Department of Electrical Engineering,The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045512282","display_name":"Mircea Lazar","orcid":"https://orcid.org/0000-0003-4338-9004"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"M. Lazar","raw_affiliation_strings":["Eindhoven University of Technology,Department of Electrical Engineering,The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Department of Electrical Engineering,The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016508380","display_name":"D. Goswami","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"D. Goswami","raw_affiliation_strings":["Eindhoven University of Technology,Department of Electrical Engineering,The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Department of Electrical Engineering,The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26096572,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"800","last_page":"805"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10192","display_name":"Catalytic Processes in Materials Science","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9855999946594238,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7034000158309937},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.6031000018119812},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5551999807357788},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.553600013256073},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5437999963760376},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.490200012922287},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4140999913215637},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4101000130176544},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3797999918460846}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7034000158309937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.640999972820282},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6031000018119812},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5551999807357788},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.553600013256073},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5437999963760376},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5383999943733215},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.490200012922287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4593000113964081},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44130000472068787},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4140999913215637},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4101000130176544},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C172205157","wikidata":"https://www.wikidata.org/wiki/Q1782962","display_name":"Model predictive control","level":3,"score":0.37619999051094055},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3529999852180481},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3508000075817108},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.32409998774528503},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.30469998717308044},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29350000619888306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2892000079154968},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2549000084400177}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ccta53793.2025.11151400","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccta53793.2025.11151400","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Conference on Control Technology and Applications (CCTA)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire/84a7c473-4fc9-46d5-afe3-861e2402c54d","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/84a7c473-4fc9-46d5-afe3-861e2402c54d","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Verheijen, P C N, Elkady, M, Lazar, M & Goswami, D 2025, A GPU-Aware Batched Branch and Bound Method for Solving Mixed-Binary MPC Problems. in C Vermillion, S Olaru, J Mathieu, M Mercangoz, S Stockar, A Karimi, T Faulwasser, E Kerrigan, R Fineisen, S Gros, I Prodan, C Edwards, F Dabbene, A Chapman & B Touri (eds), 2025 IEEE Conference on Control Technology and Applications, CCTA 2025., 11151400, Institute of Electrical and Electronics Engineers, pp. 800-805, 9th IEEE Conference on Control Technology and Applications, CCTA 2025, San Diego, California, United States, 25/08/25. https://doi.org/10.1109/CCTA53793.2025.11151400","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/84a7c473-4fc9-46d5-afe3-861e2402c54d","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/84a7c473-4fc9-46d5-afe3-861e2402c54d","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Verheijen, P C N, Elkady, M, Lazar, M & Goswami, D 2025, A GPU-Aware Batched Branch and Bound Method for Solving Mixed-Binary MPC Problems. in C Vermillion, S Olaru, J Mathieu, M Mercangoz, S Stockar, A Karimi, T Faulwasser, E Kerrigan, R Fineisen, S Gros, I Prodan, C Edwards, F Dabbene, A Chapman & B Touri (eds), 2025 IEEE Conference on Control Technology and Applications, CCTA 2025., 11151400, Institute of Electrical and Electronics Engineers, pp. 800-805, 9th IEEE Conference on Control Technology and Applications, CCTA 2025, San Diego, California, United States, 25/08/25. https://doi.org/10.1109/CCTA53793.2025.11151400","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2469727591","display_name":null,"funder_award_id":"P19-45","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334952","display_name":"Wageningen University and Research","ror":"https://ror.org/04qw24q55"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1977985274","https://openalex.org/W2042811814","https://openalex.org/W2060032012","https://openalex.org/W2232852496","https://openalex.org/W2578990761","https://openalex.org/W2903503922","https://openalex.org/W3085548870","https://openalex.org/W3174958559","https://openalex.org/W4213255380","https://openalex.org/W4240374930","https://openalex.org/W4382403803","https://openalex.org/W4386953337","https://openalex.org/W4400946559"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Model":[0],"Predictive":[1],"Control":[2],"is":[3,108,147],"a":[4,38,77,110,119,131,137,182,189,202,212,226,239],"powerful":[5],"technique":[6],"for":[7,149,181,211],"dynamic":[8],"optimization":[9],"in":[10,23,165,193,201,237],"various":[11],"industrial":[12],"applications.":[13],"In":[14,156],"many":[15],"such":[16,54,154],"control":[17],"applications,":[18],"some":[19],"variables":[20,32],"are":[21],"binary":[22,31,128],"nature,":[24],"i.e.,":[25],"either":[26],"on":[27],"or":[28],"off.":[29],"Integrating":[30],"into":[33,69,174],"the":[34,45,48,57,67,97,104,125,143,150,162,176,197,208],"MPC":[35,41],"problem,":[36,42],"forming":[37,72],"mixed-binary":[39],"integer":[40,60],"significantly":[43],"increases":[44],"complexity":[46],"of":[47,115,127,140,153,191,231],"problem.":[49],"A":[50],"way":[51],"to":[52,75,118,168,195,224],"handle":[53],"problem":[55,68],"complexity,":[56],"classical":[58],"mixed":[59],"branch":[61,121,198],"and":[62,80,103],"bound":[63],"solver":[64],"algorithm":[65],"breaks":[66],"sub-problems":[70],"(nodes),":[71],"computational":[73],"branches":[74,83,180,192],"reach":[76,225],"candidate":[78,204,227],"solution,":[79],"eliminating":[81],"all":[82],"that":[84,199],"cannot":[85],"obtain":[86],"an":[87],"optimal":[88],"solution.":[89,205,228],"This":[90],"approach":[91],"enables":[92],"massive":[93],"parallel":[94,141,179,194],"processing":[95],"since":[96],"nodes":[98,116,223],"can":[99],"be":[100],"computed":[101],"independently,":[102],"GPU-enabled":[105],"computing":[106],"paradigm":[107],"thus":[109],"natural":[111],"target.":[112],"The":[113],"number":[114,126,139],"belonging":[117],"specific":[120],"grows":[122],"exponentially":[123],"with":[124,235],"variables.":[129],"Since":[130],"given":[132,183,213],"GPU":[133,163],"architecture":[134],"may":[135],"tackle":[136],"finite":[138],"branches,":[142],"node":[144],"selection":[145],"procedure":[146],"crucial":[148],"actual":[151],"deployment":[152],"methods.":[155],"our":[157,232],"proposed":[158,233],"method,":[159],"we":[160,187,215],"exploit":[161],"parallelism":[164],"two":[166],"ways":[167],"achieve":[169],"this":[170],"while":[171],"explicitly":[172],"taking":[173],"account":[175],"maximum":[177],"feasible":[178],"memory":[184],"architecture.":[185],"First,":[186],"explore":[188],"batch":[190],"identify":[196],"results":[200],"good":[203],"Secondly,":[206],"at":[207],"same":[209],"time,":[210],"branch,":[214],"traverse":[216],"over":[217],"it":[218],"efficiently":[219],"by":[220],"skipping":[221],"intermediate":[222],"Initial":[229],"comparison":[230],"method":[234],"Gurobi":[236],"controlling":[238],"four-tank":[240],"system":[241],"shows":[242],"promising":[243],"results.":[244]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}