{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:13:25Z","timestamp":1778861605441,"version":"3.51.4"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T00:00:00Z","timestamp":1678060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T00:00:00Z","timestamp":1678060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s11227-023-05109-2","type":"journal-article","created":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T18:02:25Z","timestamp":1678125745000},"page":"12042-12073","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A fast MILP solver for high-level synthesis based on heuristic model reduction and enhanced branch and bound algorithm"],"prefix":"10.1007","volume":"79","author":[{"given":"Mina","family":"Mirhosseini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmood","family":"Fazlali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad K","family":"Fallah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeong-A","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,6]]},"reference":[{"key":"5109_CR1","doi-asserted-by":"crossref","unstructured":"Gorgin S, Gholamrezaei MH, Javaheri D, Lee J-A (2022) An efficient fpga implementation of k-nearest neighbors via online arithmetic. In: 2022 IEEE 30th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE, pp 1\u20132","DOI":"10.1109\/FCCM53951.2022.9786165"},{"key":"5109_CR2","volume":"1","author":"D Javaheri","year":"2022","unstructured":"Javaheri D, Gorgin S, Lee J-A, Masdari M (2022) An improved discrete Harris hawk optimization algorithm for efficient workflow scheduling in multi-fog computing. Sustain Comput Inf Syst 1:100787","journal-title":"Sustain Comput Inf Syst"},{"key":"5109_CR3","volume-title":"Synthesis and optimization of digital circuits","author":"GD Micheli","year":"1994","unstructured":"Micheli GD (1994) Synthesis and optimization of digital circuits. McGraw-Hill Higher Education, New York"},{"key":"5109_CR4","doi-asserted-by":"crossref","unstructured":"Folmer HH, Groote Rd, Bekooij MJG (2022) High-level synthesis of digital circuits from template haskell and sdf-ap. In: Orailoglu A, Reichenbach M, Jung M (eds) Embedded computer systems: architectures, modeling, and simulation. Springer, Cham, pp 3\u201327","DOI":"10.1007\/978-3-031-15074-6_1"},{"key":"5109_CR5","doi-asserted-by":"crossref","unstructured":"Lahti S, Rintala M, H\u00e4m\u00e4l\u00e4inen TD (2022) Leveraging modern c++ in high-level synthesis. IEEE Trans Comput-Aided Des Integrated Circuits Syst","DOI":"10.1109\/TCAD.2022.3193646"},{"key":"5109_CR6","doi-asserted-by":"crossref","unstructured":"Folmer HH, Groote Rd, Bekooij MJG (2022) High-level synthesis of digital circuits from template haskell and sdf-ap. In: Orailoglu A, Reichenbach M, Jung M (eds) Embedded computer systems: architectures, modeling, and simulation. Springer, Cham, pp 3\u201327","DOI":"10.1007\/978-3-031-15074-6_1"},{"key":"5109_CR7","doi-asserted-by":"publisher","unstructured":"Guo L, Chi Y, Lau J, Song L, Tian X, Khatti M, Qiao W, Wang J, Ustun E, Fang Z, Zhang Z, Cong J (2022) TAPA: a scalable task-parallel dataflow programming framework for modern FPGAs with co-optimization of HLS and physical design. https:\/\/doi.org\/10.48550\/ARXIV.2209.02663","DOI":"10.48550\/ARXIV.2209.02663"},{"key":"5109_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2020.102722","volume":"101","author":"MK Fallah","year":"2021","unstructured":"Fallah MK, Fazlali M (2021) Parallel branch and bound algorithm for solving integer linear programming models derived from behavioral synthesis. Parall Comput 101:102722","journal-title":"Parall Comput"},{"key":"5109_CR9","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.jpdc.2016.11.014","volume":"103","author":"Y Li","year":"2017","unstructured":"Li Y, Niu J, Atiquzzaman M, Long X (2017) Energy-aware scheduling on heterogeneous multi-core systems with guaranteed probability. J Parall Distrib Comput 103:64\u201376","journal-title":"J Parall Distrib Comput"},{"key":"5109_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-36605-9_20","volume-title":"Applications of evolutionary computing","author":"I Dumitrescu","year":"2003","unstructured":"Dumitrescu I, St\u00fctzle T (2003) Combinations of local search and exact algorithms. In: Cagnoni S, Johnson CG, Cardalda JJR, Marchiori E, Corne DW, Meyer J-A, Gottlieb J, Middendorf M, Guillot A, Raidl GR, Hart E (eds) Applications of evolutionary computing. Springer, Berlin, pp 211\u2013223"},{"key":"5109_CR11","first-page":"41","volume-title":"Artificial intelligence and knowledge engineering applications: a bioinspired approach","author":"J Puchinger","year":"2005","unstructured":"Puchinger J, Raidl GR (2005) Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In: Mira J, \u00c1lvarez JR (eds) Artificial intelligence and knowledge engineering applications: a bioinspired approach. Springer, Berlin, pp 41\u201353"},{"key":"5109_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2022.107935","volume":"100","author":"SM Aziz","year":"2022","unstructured":"Aziz SM, Hoskin DH, Pham DM, Kamruzzaman J (2022) Remote reconfiguration of fpga-based wireless sensor nodes for flexible internet of things. Comput Electr Eng 100:107935","journal-title":"Comput Electr Eng"},{"key":"5109_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2020.103589","volume":"80","author":"Z Zhou","year":"2021","unstructured":"Zhou Z, Liu Y, Yu H, Chen Q (2021) Logistics supply chain information collaboration based on fpga and internet of things system. Microprocess Microsyst 80:103589","journal-title":"Microprocess Microsyst"},{"issue":"3","key":"5109_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3506713","volume":"15","author":"C Bobda","year":"2022","unstructured":"Bobda C, Mbongue JM, Chow P, Ewais M, Tarafdar N, Vega JC, Eguro K, Koch D, Handagala S, Leeser M et al (2022) The future of fpga acceleration in datacenters and the cloud. ACM Trans Reconfigurable Technol Syst (TRETS) 15(3):1\u201342","journal-title":"ACM Trans Reconfigurable Technol Syst (TRETS)"},{"key":"5109_CR15","volume":"35","author":"Y Liao","year":"2022","unstructured":"Liao Y, Adegbija T, Lysecky R (2022) A high-level synthesis approach for precisely-timed, energy-efficient embedded systems. Sustain Comput: Inf Syst 35:100741","journal-title":"Sustain Comput: Inf Syst"},{"key":"5109_CR16","doi-asserted-by":"crossref","unstructured":"Purushothaman P, Srihari S, Deivalakshmi S (2021) High-level synthesis of cellular automata-belousov zhabotinsky reaction in fpga. In: Machine Learning. Deep Learning and Computational Intelligence for Wireless Communication. Springer, Singapore, pp 341\u2013349","DOI":"10.1007\/978-981-16-0289-4_26"},{"issue":"4","key":"5109_CR17","doi-asserted-by":"publisher","first-page":"2591","DOI":"10.1007\/s10586-019-03030-z","volume":"23","author":"G You","year":"2020","unstructured":"You G, Wang X (2020) A server-side accelerator framework for multi-core cpus and intel xeon phi co-processor systems. Clust Comput 23(4):2591\u20132608","journal-title":"Clust Comput"},{"key":"5109_CR18","doi-asserted-by":"crossref","unstructured":"Bournias I, Chotin R, Lacassagne L (2022) Using hls for designing a parametric optical flow hierarchical algorithm in fpgas. In: IEEE International Symposium on Circuits and Systems (ISCAS 2022)","DOI":"10.1109\/ISCAS48785.2022.9937732"},{"issue":"2","key":"5109_CR19","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1109\/TII.2020.2987329","volume":"17","author":"J Arias-Garcia","year":"2020","unstructured":"Arias-Garcia J, Mafra A, Gade L, Coelho F, Castro C, Torres L, Braga A (2020) Enhancing performance of gabriel graph-based classifiers by a hardware co-processor for embedded system applications. IEEE Trans Industr Inf 17(2):1186\u20131196","journal-title":"IEEE Trans Industr Inf"},{"issue":"10","key":"5109_CR20","doi-asserted-by":"publisher","first-page":"2346","DOI":"10.1109\/TPDS.2020.2990924","volume":"31","author":"C Wang","year":"2020","unstructured":"Wang C, Gong L, Li X, Zhou X (2020) A ubiquitous machine learning accelerator with automatic parallelization on fpga. IEEE Trans Parallel Distrib Syst 31(10):2346\u20132359","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5109_CR21","doi-asserted-by":"publisher","first-page":"175637","DOI":"10.1109\/ACCESS.2020.3026831","volume":"8","author":"M Elnawawy","year":"2020","unstructured":"Elnawawy M, Sagahyroon A, Shanableh T (2020) Fpga-based network traffic classification using machine learning. IEEE Access 8:175637\u2013175650","journal-title":"IEEE Access"},{"key":"5109_CR22","unstructured":"Shahsavani SN, Fayyazi A, Nazemi M, Pedram M (2022) Efficient compilation and mapping of fixed function combinational logic onto digital signal processors targeting neural network inference and utilizing high-level synthesis. ACM Transactions on Reconfigurable Technology and Systems (TRETS)"},{"key":"5109_CR23","doi-asserted-by":"crossref","unstructured":"Lo M, Fang Z, Wang J, Zhou P, Chang M-CF, Cong J (2020) Algorithm-hardware co-design for bqsr acceleration in genome analysis toolkit. In: 2020 IEEE 28th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE, pp 157\u2013166","DOI":"10.1109\/FCCM48280.2020.00029"},{"key":"5109_CR24","doi-asserted-by":"crossref","unstructured":"Young-Schultz T, Lilge L, Brown S, Betz V (2020) Using opencl to enable software-like development of an fpga-accelerated biophotonic cancer treatment simulator. In: Proceedings of the 2020 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, pp 86\u201396","DOI":"10.1145\/3373087.3375300"},{"key":"5109_CR25","doi-asserted-by":"crossref","unstructured":"Choi Y-k, Chi Y, Lau J, Cong J (2022) Taro: Automatic optimization for free-running kernels in fpga high-level synthesis. In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","DOI":"10.1109\/TCAD.2022.3216544"},{"key":"5109_CR26","doi-asserted-by":"crossref","unstructured":"Song L, Chi Y, Sohrabizadeh A, Choi Y-k, Lau J, Cong J (2022) Sextans: A streaming accelerator for general-purpose sparse-matrix dense-matrix multiplication. In: Proceedings of the 2022 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, pp 65\u201377","DOI":"10.1145\/3490422.3502357"},{"key":"5109_CR27","doi-asserted-by":"crossref","unstructured":"din Dawrayn AM, Bilal M, (2022) Svm-based switching filter hardware design for mixed noise reduction in digital images using high-level synthesis tools. Int J Comput Vis Image Process (IJCVIP) 12(1):1\u201316","DOI":"10.4018\/IJCVIP.2022010106"},{"key":"5109_CR28","doi-asserted-by":"crossref","unstructured":"Islam SA, Katkoori S (2022) Behavioral synthesis of key-obfuscated rtl ip. In: Behavioral Synthesis for Hardware Security. Springer, Berlin, pp 17\u201342","DOI":"10.1007\/978-3-030-78841-4_2"},{"issue":"4","key":"5109_CR29","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/TCAD.2011.2110592","volume":"30","author":"J Cong","year":"2011","unstructured":"Cong J, Liu B, Neuendorffer S, Noguera J, Vissers K, Zhang Z (2011) High-level synthesis for fpgas: from prototyping to deployment. IEEE Trans Comput Aided Des Integr Circuits Syst 30(4):473\u2013491","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"5109_CR30","unstructured":"Jose S (2022) Vivado design suite user guide: high-level synthesis. UG-902, Xilinx). https:\/\/docs.xilinx.com\/v\/u\/en-US\/ug902-vivado-high- level-synthesis"},{"key":"5109_CR31","doi-asserted-by":"crossref","unstructured":"Canis A, Choi J, Aldham M, Zhang V, Kammoona A, Anderson JH, Brown S, Czajkowski T (2011) Legup: high-level synthesis for fpga-based processor\/accelerator systems. In: Proceedings of the 19th ACM\/SIGDA International Symposium on Field Programmable Gate Arrays, pp 33\u201336","DOI":"10.1145\/1950413.1950423"},{"key":"5109_CR32","unstructured":"Ropponen J (2021) Feasibility of using high-level synthesis in fpga design: evaluating the capabilities of intel high-level synthesis compiler"},{"key":"5109_CR33","doi-asserted-by":"crossref","unstructured":"Pilato C, Ferrandi F (2013) Bambu: A modular framework for the high level synthesis of memory-intensive applications. In: 2013 23rd International Conference on Field Programmable Logic and Applications. IEEE, pp 1\u20134","DOI":"10.1109\/FPL.2013.6645550"},{"issue":"4","key":"5109_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3530775","volume":"15","author":"J Cong","year":"2022","unstructured":"Cong J, Lau J, Liu G, Neuendorffer S, Pan P, Vissers K, Zhang Z (2022) Fpga hls today: successes, challenges, and opportunities. ACM Trans Reconfigurable Technol Syst (TRETS) 15(4):1\u201342","journal-title":"ACM Trans Reconfigurable Technol Syst (TRETS)"},{"key":"5109_CR35","doi-asserted-by":"crossref","unstructured":"Molina RS, Gil-Costa V, Crespo ML, Ramponi G (2022) High-level synthesis hardware design for fpga-based accelerators: Models, methodologies, and frameworks. IEEE Access","DOI":"10.1109\/ACCESS.2022.3201107"},{"key":"5109_CR36","doi-asserted-by":"crossref","unstructured":"Fallah MK, Mirhosseini M, Fazlali M, Daneshtalab M (2020) Scalable parallel genetic algorithm for solving large integer linear programming models derived from behavioral synthesis. In: 2020 28th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp 390\u2013394","DOI":"10.1109\/PDP50117.2020.00066"},{"issue":"2","key":"5109_CR37","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/s11227-010-0458-3","volume":"59","author":"M Fazlali","year":"2012","unstructured":"Fazlali M, Zakerolhosseini A, Gaydadjiev G (2012) Efficient datapath merging for the overhead reduction of run-time reconfigurable systems. J Supercomput 59(2):636\u2013657","journal-title":"J Supercomput"},{"key":"5109_CR38","first-page":"1","volume":"1","author":"M Fazlali","year":"2019","unstructured":"Fazlali M, Fallah MK, Hosseinpour N, Katanforoush A (2019) Accelerating datapath merging by task parallelisation on multicore systems. Int J Parall Emergent Distrib Syst 1:1\u201314","journal-title":"Int J Parall Emergent Distrib Syst"},{"issue":"1","key":"5109_CR39","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1049\/ip-cdt:20010208","volume":"148","author":"A Williams","year":"2001","unstructured":"Williams A, Brown A, Baidas Z (2001) Optimisation in behavioural synthesis using hierarchical expansion: module ripping. Comput Digit Tech 148(1):31\u201343","journal-title":"Comput Digit Tech"},{"key":"5109_CR40","doi-asserted-by":"crossref","unstructured":"Chabini N, Wolf W (2005) Unification of scheduling, binding, and retiming to reduce power consumption under timings and resources constraints. IEEE Trans Very Large Scale Integration (VLSI) Syst 13(10):1113\u20131126","DOI":"10.1109\/TVLSI.2005.859482"},{"key":"5109_CR41","unstructured":"Dilek S, Smri R, Tosun S, Dal D (2020) A high-level synthesis methodology for energy and reliability-oriented designs. IEEE Trans Comput"},{"issue":"3","key":"5109_CR42","doi-asserted-by":"publisher","first-page":"2667","DOI":"10.1007\/s11227-020-03365-0","volume":"77","author":"Y Nalci","year":"2021","unstructured":"Nalci Y, Kullu P, Tosun S, Ozturk O (2021) Ilp formulation and heuristic method for energy-aware application mapping on 3d-nocs. J Supercomput 77(3):2667\u20132680","journal-title":"J Supercomput"},{"issue":"5","key":"5109_CR43","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1109\/TCAD.2018.2834421","volume":"38","author":"C Pilato","year":"2018","unstructured":"Pilato C, Wu K, Garg S, Karri R, Regazzoni F (2018) Tainthls: high-level synthesis for dynamic information flow tracking. IEEE Trans Comput Aided Des Integr Circuits Syst 38(5):798\u2013808","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"5109_CR44","doi-asserted-by":"crossref","unstructured":"Fallah MK, Keshvari VS, Fazlali M (2019) A parallel hybrid genetic algorithm for solving the maximum clique problem. In: International Congress on High-Performance Computing and Big Data Analysis . Springer, pp 378\u2013393","DOI":"10.1007\/978-3-030-33495-6_29"},{"key":"5109_CR45","doi-asserted-by":"crossref","unstructured":"Fazlali M, Fallah MK, Zolghadr M, Zakerolhosseini A (2009) A new datapath merging method for reconfigurable system. In: International Workshop on Applied Reconfigurable Computing. Springer, pp 157\u2013168","DOI":"10.1007\/978-3-642-00641-8_17"},{"key":"5109_CR46","unstructured":"Fazlali M, Zakerolhosseini A, Sabeghi M, Bertels K, Gaydadjiev G (2009) Data path configuration time reduction for run-time reconfigurable systems. In: ERSA, pp 323\u2013327"},{"issue":"11","key":"5109_CR47","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.sysarc.2010.07.016","volume":"56","author":"M Fazlali","year":"2010","unstructured":"Fazlali M, Sabeghi M, Zakerolhosseini A, Bertels K (2010) Efficient task scheduling for runtime reconfigurable systems. J Syst Architect 56(11):623\u2013632","journal-title":"J Syst Architect"},{"key":"5109_CR48","doi-asserted-by":"crossref","unstructured":"Barik R, Grothoff C, Gupta R, Pandit V, Udupa R (2006) Optimal bitwise register allocation using integer linear programming. In: International Workshop on Languages and Compilers for Parallel Computing. Springer, pp 267\u2013282","DOI":"10.1007\/978-3-540-72521-3_20"},{"issue":"2","key":"5109_CR49","first-page":"1","volume":"21","author":"L Chen","year":"2016","unstructured":"Chen L, Ebrahimi M, Tahoori MB (2016) Reliability-aware resource allocation and binding in high-level synthesis. ACM Trans Des Autom Electron Syst (TODAES) 21(2):1\u201327","journal-title":"ACM Trans Des Autom Electron Syst (TODAES)"},{"issue":"2","key":"5109_CR50","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TCSI.2017.2725916","volume":"65","author":"J Chen","year":"2017","unstructured":"Chen J, Chang C-H, Ding J, Qiao R, Faust M (2017) Tap delay-and-accumulate cost aware coefficient synthesis algorithm for the design of area-power efficient fir filters. IEEE Trans Circuits Syst I Regul Pap 65(2):712\u2013722","journal-title":"IEEE Trans Circuits Syst I Regul Pap"},{"key":"5109_CR51","doi-asserted-by":"crossref","unstructured":"Taher FN, Kishani M, Schafer BC (2018) Design and optimization of reliable hardware accelerators: Leveraging the advantages of high-level synthesis. In: 2018 IEEE 24th International Symposium on On-Line Testing And Robust System Design (IOLTS). IEEE, pp 232\u2013235","DOI":"10.1109\/IOLTS.2018.8474222"},{"issue":"5","key":"5109_CR52","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1109\/TPDS.2020.3039409","volume":"32","author":"J de Fine Licht","year":"2020","unstructured":"de Fine Licht J, Besta M, Meierhans S, Hoefler T (2020) Transformations of high-level synthesis codes for high-performance computing. IEEE Trans Parallel Distrib Syst 32(5):1014\u20131029","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5109_CR53","doi-asserted-by":"crossref","unstructured":"Nam H, Lysecky R (2018) Security-aware multi-objective optimization of distributed reconfigurable embedded systems. J Parall Distrib Comput","DOI":"10.1016\/j.jpdc.2018.02.015"},{"key":"5109_CR54","doi-asserted-by":"crossref","unstructured":"Lee S, Gerstlauer A (2019) Approximate high-level synthesis of custom hardware. In: Approximate Circuits. Springer, Cham, pp 205\u2013223","DOI":"10.1007\/978-3-319-99322-5_10"},{"key":"5109_CR55","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.jpdc.2018.02.010","volume":"117","author":"C Bobda","year":"2018","unstructured":"Bobda C, Yonga F, Gebser M, Ishebabi H, Schaub T (2018) High-level synthesis of on-chip multiprocessor architectures based on answer set programming. J Parall Distrib Comput 117:161\u2013179","journal-title":"J Parall Distrib Comput"},{"issue":"3","key":"5109_CR56","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TPDS.2013.57","volume":"25","author":"H Arabnejad","year":"2013","unstructured":"Arabnejad H, Barbosa JG (2013) List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans Parallel Distrib Syst 25(3):682\u2013694","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5109_CR57","doi-asserted-by":"crossref","unstructured":"Fazlali M, Zakerolhosseini A, Shahbahrami A, Gaydadjiev G (2009) High speed merged-datapath design for run-time reconfigurable systems. In: 2009 International Conference on Field-Programmable Technology. IEEE, pp 339\u2013343","DOI":"10.1109\/FPT.2009.5377678"},{"issue":"5","key":"5109_CR58","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10951-017-0550-0","volume":"21","author":"D Knop","year":"2018","unstructured":"Knop D, Kouteck\u1ef3 M (2018) Scheduling meets n-fold integer programming. J Sched 21(5):493\u2013503","journal-title":"J Sched"},{"key":"5109_CR59","first-page":"1","volume":"1","author":"M Sulaiman","year":"2021","unstructured":"Sulaiman M, Halim Z, Waqas M, Ayd\u0131n D (2021) A hybrid list-based task scheduling scheme for heterogeneous computing. J Supercomput 1:1\u201337","journal-title":"J Supercomput"},{"key":"5109_CR60","first-page":"1","volume":"1","author":"D Sirisha","year":"2022","unstructured":"Sirisha D, Prasad SS (2022) Mpeft: a makespan minimizing heuristic scheduling algorithm for workflows in heterogeneous computing systems. CCF Trans High Perform Comput 1:1\u201316","journal-title":"CCF Trans High Perform Comput"},{"key":"5109_CR61","doi-asserted-by":"crossref","unstructured":"Fallah MK, Fazlali M, Daneshtalab M (2021) A symbiosis between population based incremental learning and lp-relaxation based parallel genetic algorithm for solving integer linear programming models. Computing 1\u201319","DOI":"10.1007\/s00607-021-01004-x"},{"key":"5109_CR62","doi-asserted-by":"crossref","unstructured":"Belwal M, Ramesh T (2022) N-pir: a neighborhood-based pareto iterative refinement approach for high-level synthesis. Arab J Sci Eng 1\u201317","DOI":"10.1016\/j.jestch.2021.11.004"},{"key":"5109_CR63","unstructured":"Taha HA (2014) Integer Programming: Theory, Applications, and Computations, United States"},{"issue":"5","key":"5109_CR64","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/358438.349318","volume":"35","author":"K Wilken","year":"2000","unstructured":"Wilken K, Liu J, Heffernan M (2000) Optimal instruction scheduling using integer programming. Acm Sigplan Not 35(5):121\u2013133","journal-title":"Acm Sigplan Not"},{"key":"5109_CR65","doi-asserted-by":"crossref","unstructured":"Rodionov A, Rose J (2017) Synchronization constraints for interconnect synthesis. In: Proceedings of the 2017 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, pp 95\u2013104","DOI":"10.1145\/3020078.3021729"},{"issue":"10","key":"5109_CR66","doi-asserted-by":"publisher","first-page":"146","DOI":"10.3390\/computers11100146","volume":"11","author":"K Ohata","year":"2022","unstructured":"Ohata K, Nishikawa H, Kong X, Tomiyama H (2022) Ilp-based and heuristic scheduling techniques for variable-cycle approximate functional units in high-level synthesis. Computers 11(10):146","journal-title":"Computers"},{"key":"5109_CR67","doi-asserted-by":"crossref","unstructured":"Gay DM (2015) The ampl modeling language: An aid to formulating and solving optimization problems. In: Numerical Analysis and Optimization. Springer, Cham, pp 95\u2013116","DOI":"10.1007\/978-3-319-17689-5_5"},{"key":"5109_CR68","doi-asserted-by":"crossref","unstructured":"Bussieck MR, Meeraus A (2004) General Algebraic Modeling System (GAMS). Springer, Boston, MA, pp 137\u2013157","DOI":"10.1007\/978-1-4613-0215-5_8"},{"issue":"4\u20135","key":"5109_CR69","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin Y, Schrage L (2009) The global solver in the lindo api. Optim Methods Softw 24(4\u20135):657\u2013668","journal-title":"Optim Methods Softw"},{"issue":"3","key":"5109_CR70","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1080\/10556788.2017.1333612","volume":"33","author":"T Berthold","year":"2018","unstructured":"Berthold T, Farmer J, Heinz S, Perregaard M (2018) Parallelization of the fico xpress-optimizer. Optim Methods Softw 33(3):518\u2013529","journal-title":"Optim Methods Softw"},{"key":"5109_CR71","unstructured":"Gurobi\u00a0Optimization L (2019) Gurobi optimizer (Version 9.0)"},{"key":"5109_CR72","unstructured":"CPLEX I (2014) ILOG CPLEX 12.6 Optimization Studio. IBM, New York, NY, USA"},{"issue":"6","key":"5109_CR73","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"PC Gilmore","year":"1963","unstructured":"Gilmore PC, Gomory RE (1963) A linear programming approach to the cutting stock problem-part ii. Oper Res 11(6):863\u2013888","journal-title":"Oper Res"},{"key":"5109_CR74","first-page":"65","volume":"1","author":"JE Mitchell","year":"2002","unstructured":"Mitchell JE (2002) Branch-and-cut algorithms for combinatorial optimization problems. Handb Appl Optim 1:65\u201377","journal-title":"Handb Appl Optim"},{"issue":"2","key":"5109_CR75","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1016\/j.ejor.2019.09.043","volume":"282","author":"M Fischetti","year":"2020","unstructured":"Fischetti M, Monaci M (2020) A branch-and-cut algorithm for mixed-integer bilinear programming. Eur J Oper Res 282(2):506\u2013514","journal-title":"Eur J Oper Res"},{"key":"5109_CR76","unstructured":"Clausen J (1999) Branch and bound algorithms-principles and examples. Department of Computer Science, University of Copenhagen, 1\u201330"},{"issue":"4","key":"5109_CR77","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1287\/ijoc.2018.0856","volume":"31","author":"SN Parragh","year":"2019","unstructured":"Parragh SN, Tricoire F (2019) Branch-and-bound for bi-objective integer programming. INFORMS J Comput 31(4):805\u2013822","journal-title":"INFORMS J Comput"},{"key":"5109_CR78","first-page":"3293","volume":"27","author":"H He","year":"2014","unstructured":"He H, Daume H III, Eisner JM (2014) Learning to search in branch and bound algorithms. Adv Neural Inf Process Syst 27:3293\u20133301","journal-title":"Adv Neural Inf Process Syst"},{"key":"5109_CR79","doi-asserted-by":"crossref","unstructured":"Karmarkar N (1984) A new polynomial-time algorithm for linear programming. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp 302\u2013311","DOI":"10.1145\/800057.808695"},{"key":"5109_CR80","doi-asserted-by":"crossref","unstructured":"Desai J, Wang K (2011) Lagrangian optimization for lp: Theory and algorithms. Wiley Encyclopedia of Operations Research and Management Science, pp 1\u201319","DOI":"10.1002\/9780470400531.eorms0447.pub2"},{"key":"5109_CR81","unstructured":"Forrest J (1989) Mathematical programming with a library of optimization subroutines. In: ORSA\/TIMS Joint National Meeting, New York"},{"issue":"5","key":"5109_CR82","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1287\/opre.40.5.885","volume":"40","author":"RE Bixby","year":"1992","unstructured":"Bixby RE, Gregory JW, Lustig IJ, Marsten RE, Shanno DF (1992) Very large-scale linear programming: a case study in combining interior point and simplex methods. Oper Res 40(5):885\u2013897","journal-title":"Oper Res"},{"key":"5109_CR83","unstructured":"Gao W, Sun C, Ye Y, Ye Y (2021) Boosting method in approximately solving linear programming with fast online algorithm. arXiv preprint arXiv:2107.03570"},{"key":"5109_CR84","unstructured":"Mediabench (2019) http:\/\/mathstat.slu.edu\/~fritts\/mediabench"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05109-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05109-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05109-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T23:03:10Z","timestamp":1686351790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05109-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,6]]},"references-count":84,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["5109"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05109-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,6]]},"assertion":[{"value":"7 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}