{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T05:39:06Z","timestamp":1777354746705,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T00:00:00Z","timestamp":1630627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T00:00:00Z","timestamp":1630627200000},"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":["Computing"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s00607-021-01004-x","type":"journal-article","created":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T00:04:45Z","timestamp":1630713885000},"page":"1121-1139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A symbiosis between population based incremental learning and LP-relaxation based parallel genetic algorithm for solving integer linear programming models"],"prefix":"10.1007","volume":"105","author":[{"given":"Mohammad K","family":"Fallah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1701-5562","authenticated-orcid":false,"given":"Mahmood","family":"Fazlali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masoud","family":"Daneshtalab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,3]]},"reference":[{"key":"1004_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1018915104438","volume":"86","author":"D Abramson","year":"1999","unstructured":"Abramson D, Randall M (1999) A simulated annealing code for general integer linear programs. Ann Oper Res 86:3\u201321","journal-title":"Ann Oper Res"},{"issue":"4","key":"1004_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/TEVC.2003.814633","volume":"7","author":"CW Ahn","year":"2003","unstructured":"Ahn CW, Ramakrishna RS (2003) Elitism-based compact genetic algorithms. IEEE Trans Evol Comput 7(4):367\u2013385","journal-title":"IEEE Trans Evol Comput"},{"key":"1004_CR3","unstructured":"Baluja S (1994) Population-based incremental learning. A method for integrating genetic search based function optimization and competitive learning. Tech. rep., Carnegie-Mellon Univ Pittsburgh Pa Dept Of Computer Science"},{"key":"1004_CR4","first-page":"38","volume-title":"Machine learning proceedings","author":"S Baluja","year":"1995","unstructured":"Baluja S, Caruana R (1995) Removing the genetics from the standard genetic algorithm. Machine learning proceedings. Elsevier, Amsterdam, pp 38\u201346"},{"key":"1004_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-981-13-2414-7_5","volume-title":"Smart innovations in communication and computational sciences","author":"A Bose","year":"2019","unstructured":"Bose A, Biswas T, Kuila P (2019) A novel genetic algorithm based scheduling for multi-core systems. Smart innovations in communication and computational sciences. Springer, New York, pp 45\u201354"},{"issue":"2","key":"1004_CR6","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.ejor.2019.04.025","volume":"278","author":"PM Castro","year":"2019","unstructured":"Castro PM, Harjunkoski I, Grossmann IE (2019) Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling. Eur J Oper Res 278(2):563\u2013577","journal-title":"Eur J Oper Res"},{"issue":"10","key":"1004_CR7","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1109\/TVLSI.2005.859482","volume":"13","author":"N Chabini","year":"2005","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 Integr (VLSI) Syst 13(10):1113\u20131126","journal-title":"IEEE Trans Very Large Scale Integr (VLSI) Syst"},{"key":"1004_CR8","unstructured":"CPLEX I (2014) Ilog cplex 12.6 optimization studio"},{"issue":"5","key":"1004_CR9","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1109\/TLA.2018.8408446","volume":"16","author":"PH da Silva Palhares","year":"2018","unstructured":"da Silva Palhares PH, da Cunha Brito L (2018) Constrained mixed integer programming solver based on the compact genetic algorithm. IEEE Lat Am Trans 16(5):1493\u20131498","journal-title":"IEEE Lat Am Trans"},{"issue":"2","key":"1004_CR10","first-page":"505","volume":"212","author":"K Deep","year":"2009","unstructured":"Deep K, Singh KP, Kansal ML, Mohan C (2009) A real coded genetic algorithm for solving integer and mixed integer optimization problems. Appl Math Comput 212(2):505\u2013518","journal-title":"Appl Math Comput"},{"key":"1004_CR11","doi-asserted-by":"crossref","unstructured":"Esmaeili MR, Zahiri SH, Razavi SM (2019) A novel method for high-level synthesis of datapaths in digital filters using a moth-flame optimization algorithm. Evol Intell 1\u201316","DOI":"10.1007\/s12065-019-00302-w"},{"key":"1004_CR12","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"},{"key":"1004_CR13","doi-asserted-by":"publisher","first-page":"102722","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. Parallel Comput 101:102722. https:\/\/doi.org\/10.1016\/j.parco.2020.102722","journal-title":"Parallel Comput"},{"key":"1004_CR14","first-page":"157","volume-title":"International workshop on applied reconfigurable computing","author":"M Fazlali","year":"2009","unstructured":"Fazlali M, Fallah MK, Zolghadr M, Zakerolhosseini A (2009) A new datapath merging method for reconfigurable system. International workshop on applied reconfigurable computing. Springer, New York, pp 157\u2013168"},{"issue":"2","key":"1004_CR15","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":"1004_CR16","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"},{"key":"1004_CR17","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":"4","key":"1004_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"GR Harik","year":"1999","unstructured":"Harik GR, Lobo FG, Goldberg DE (1999) The compact genetic algorithm. IEEE Trans Evol Comput 3(4):287\u2013297","journal-title":"IEEE Trans Evol Comput"},{"issue":"13","key":"1004_CR19","doi-asserted-by":"publisher","first-page":"5099","DOI":"10.1007\/s00500-018-3177-y","volume":"23","author":"AAR Hosseinabadi","year":"2019","unstructured":"Hosseinabadi AAR, Vahidi J, Saemi B, Sangaiah AK, Elhoseny M (2019) Extended genetic algorithm for solving open-shop scheduling problem. Soft Comput 23(13):5099\u20135116","journal-title":"Soft Comput"},{"key":"1004_CR20","volume-title":"Optimization theory","author":"HT Jongen","year":"2007","unstructured":"Jongen HT, Meer K, Triesch E (2007) Optimization theory. Springer, New York"},{"issue":"2","key":"1004_CR21","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.ejor.2017.07.027","volume":"265","author":"RL Kadri","year":"2018","unstructured":"Kadri RL, Boctor FF (2018) An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case. Eur J Oper Res 265(2):454\u2013462","journal-title":"Eur J Oper Res"},{"key":"1004_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. Complexity of computer computations. Springer, New York, pp 85\u2013103"},{"key":"1004_CR23","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-24650-3_11","volume-title":"European conference on genetic programming","author":"K Kostikas","year":"2004","unstructured":"Kostikas K, Fragakis C (2004) Genetic programming applied to mixed integer programming. European conference on genetic programming. Springer, Neww York, pp 113\u2013124"},{"key":"1004_CR24","doi-asserted-by":"crossref","unstructured":"Kumar A, Bayoumi M (1999) Multiple voltage-based scheduling methodology for low power in the high level synthesis. In: ISCAS\u201999. Proceedings of the 1999 IEEE international symposium on circuits and systems VLSI (Cat. No. 99CH36349), vol\u00a01. IEEE, pp 371\u2013374","DOI":"10.1109\/ISCAS.1999.777880"},{"issue":"3","key":"1004_CR25","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/s11554-017-0722-3","volume":"14","author":"C Li","year":"2018","unstructured":"Li C, Bi Y, Benezeth Y, Ginhac D, Yang F (2018) High-level synthesis for fpgas: code optimization strategies for real-time image processing. J Real-Time Image Proc 14(3):701\u2013712","journal-title":"J Real-Time Image Proc"},{"key":"1004_CR26","unstructured":"Mediabench (2019) http:\/\/mathstat.slu.edu\/fritts\/mediabench"},{"key":"1004_CR27","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":"1004_CR28","doi-asserted-by":"crossref","unstructured":"Sampson JR (1976) Adaptation in natural and artificial systems (John H. Holland)","DOI":"10.1137\/1018105"},{"issue":"10","key":"1004_CR29","doi-asserted-by":"publisher","first-page":"2628","DOI":"10.1109\/TCAD.2019.2943570","volume":"39","author":"BC Schafer","year":"2019","unstructured":"Schafer BC, Wang Z (2019) High-level synthesis design space exploration: past, present, and future. IEEE Trans Comput Aided Des Integr Circuits Syst 39(10):2628\u20132639","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"1004_CR30","volume-title":"Integer programming: theory, applications, and computations","author":"HA Taha","year":"2014","unstructured":"Taha HA (2014) Integer programming: theory, applications, and computations. Academic Press, Cambridge"},{"key":"1004_CR31","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"},{"key":"1004_CR32","unstructured":"Tang X, Jiang T, Jones A, Banerjee P (2005) Behavioral synthesis of data-dominated circuits for minimal energy implementation. In: 18th international conference on VLSI design held jointly with 4th international conference on embedded systems design. IEEE, pp 267\u2013273"},{"issue":"1","key":"1004_CR33","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."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-01004-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-021-01004-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-01004-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T15:06:37Z","timestamp":1682348797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-021-01004-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,3]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1004"],"URL":"https:\/\/doi.org\/10.1007\/s00607-021-01004-x","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,3]]},"assertion":[{"value":"16 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2021","order":3,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}