{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T12:11:11Z","timestamp":1751285471943,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T00:00:00Z","timestamp":1534464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005881","name":"Emberi Eroforr\u00e1sok Miniszt\u00e9riuma","doi-asserted-by":"publisher","award":["\u00daNKP-17-3-IV-PE-1"],"award-info":[{"award-number":["\u00daNKP-17-3-IV-PE-1"]}],"id":[{"id":"10.13039\/501100005881","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10100-018-0576-1","type":"journal-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T09:06:51Z","timestamp":1534496811000},"page":"551-572","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6239-9278","authenticated-orcid":false,"given":"Aniko","family":"Bartos","sequence":"first","affiliation":[]},{"given":"Botond","family":"Bertok","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,17]]},"reference":[{"key":"576_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.jclepro.2014.12.077","volume":"92","author":"KB Aviso","year":"2015","unstructured":"Aviso KB, Cayamanda CD, Solis FDB, Danga AMR, Promentilla MAB, Yu KDS, Santos JR, Tan RR (2015) P-graph approach for GDP-optimal allocation of resources, commodities and capital in economic systems under climate change-induced crisis conditions. J Clean Prod 92:308\u2013317","journal-title":"J Clean Prod"},{"key":"576_CR2","first-page":"5-1","volume":"76","author":"DA Bader","year":"2005","unstructured":"Bader DA, Hart WE, Phillips CA (2005) Parallel algorithm design for branch and bound. Tutor Emerg Methodol Appl Oper Res 76:5-1","journal-title":"Tutor Emerg Methodol Appl Oper Res"},{"issue":"1","key":"576_CR3","doi-asserted-by":"publisher","first-page":"012018","DOI":"10.1088\/1742-6596\/256\/1\/012018","volume":"256","author":"L Barreto","year":"2010","unstructured":"Barreto L, Bauer M (2010) Parallel branch and bound algorithm\u2014a comparison between serial, OpenMP and MPI implementations. J Phys Conf Ser 256(1):012018","journal-title":"J Phys Conf Ser"},{"key":"576_CR4","unstructured":"Bartos A, Bertok B (2014) Analysis of search strategies for parallel implementation of a process-network synthesis solver. In: ASCONIKK 2014: extended abstracts I. Information technologies for logistic systems, pp 5\u201310"},{"key":"576_CR5","first-page":"303","volume":"1","author":"A Bartos","year":"2015","unstructured":"Bartos A, Bertok B (2015) Synchronization and load distribution strategies for parallel implementations of P-graph optimizer. De Gruyter Ser Logic Appl 1:303\u2013313","journal-title":"De Gruyter Ser Logic Appl"},{"key":"576_CR6","doi-asserted-by":"crossref","unstructured":"Bernini R, Bondavalli A, Lollini P, Montecchi L (2016) Combining SAN and P-graphs for the analysis and optimization of industrial processes. In: 2016 12th European dependable computing conference (EDCC), pp 97\u2013207","DOI":"10.1109\/EDCC.2016.33"},{"key":"576_CR7","unstructured":"Bertok B, Friedler F, Fan LT (1998) Random generation of test problems for process synthesis. In: Presented at the CHISA \u201998 (13th international congress of chemical and process engineering), Praha, Czech Republic, August 23\u201328"},{"issue":"1","key":"576_CR8","first-page":"166","volume":"52","author":"B Bertok","year":"2013","unstructured":"Bertok B, Barany M, Friedler F (2013) Generating and analyzing mathematical programming models of conceptual process design by p-graph software. Ind Eng Chem Res 52(1):166\u2013171","journal-title":"Ind Eng Chem Res"},{"issue":"1","key":"576_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0167-8191(99)00094-0","volume":"26","author":"B Bourbeau","year":"2000","unstructured":"Bourbeau B, Crainic TG, Gendron B (2000) Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. Parallel Comput 26(1):27\u201346","journal-title":"Parallel Comput"},{"issue":"3","key":"576_CR10","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10898-014-0199-6","volume":"61","author":"C Cartis","year":"2015","unstructured":"Cartis C, Fowkes JM, Gould NI (2015) Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties. J Glob Optim 61(3):429\u2013457","journal-title":"J Glob Optim"},{"key":"576_CR11","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.procs.2013.05.191","volume":"18","author":"I Chakroun","year":"2013","unstructured":"Chakroun I, Melab N (2013) Operator-level gpu-accelerated branch and bound algorithms. Proc Comput Sci 18:280\u2013289","journal-title":"Proc Comput Sci"},{"key":"576_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1018952429396","volume":"90","author":"J Clausen","year":"1999","unstructured":"Clausen J, Perregaard M (1999) On the best search strategy in parallel branch-and-bound: best-first search versus lazy depth-first search. Ann Oper Res 90:1\u201317","journal-title":"Ann Oper Res"},{"key":"576_CR13","first-page":"1","volume":"1","author":"TG Crainic","year":"2006","unstructured":"Crainic TG, Cun BL, Roucairol C (2006) Parallel branch-and-bound algorithms. Parallel Comb Optim 1:1\u201328","journal-title":"Parallel Comb Optim"},{"key":"576_CR14","first-page":"1891","volume":"2","author":"G Dastghaibifard","year":"2008","unstructured":"Dastghaibifard G, Ansari E, Sheykhalishahi S, Bavandpouri A, Ashoor E (2008) A parallel branch and bound algorithm for vehicle routing problem. Lect Notes Eng Comput Sci 2:1891\u20131896","journal-title":"Lect Notes Eng Comput Sci"},{"issue":"2","key":"576_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1008699010646","volume":"7","author":"J Eckstein","year":"1997","unstructured":"Eckstein J (1997) Distributed versus centralized storage and control for parallel branch and bound: mixed integer programming on the CM-5. Comput Optim Appl 7(2):199\u2013220","journal-title":"Comput Optim Appl"},{"issue":"3\u20134","key":"576_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00450-009-0083-7","volume":"23","author":"Y Evtushenko","year":"2009","unstructured":"Evtushenko Y, Posypkin M, Sigal I (2009) A framework for parallel large-scale global optimization. Comput Sci Res Dev 23(3\u20134):211\u2013215","journal-title":"Comput Sci Res Dev"},{"key":"576_CR17","first-page":"71","volume":"29","author":"LT Fan","year":"2001","unstructured":"Fan LT, Bertok B, Friedler F, Shafie S (2001) Mechanisms of ammonia-synthesis reaction revisited with the aid of a novel graph-theoretic method for determining candidate mechanisms in deriving the rate law of a catalytic reaction. Hung J Ind Chem 29:71\u201380","journal-title":"Hung J Ind Chem"},{"key":"576_CR18","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1016\/0098-1354(93)80074-W","volume":"17","author":"F Friedler","year":"1993","unstructured":"Friedler F, Tarjan K, Huang Y, Fan LT (1993) Graph-theoretic approach to process synthesis: polynomial algorithm for maximal structure generation. Comput Chem Eng 17:929","journal-title":"Comput Chem Eng"},{"key":"576_CR19","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1016\/0009-2509(95)00034-3","volume":"50","author":"F Friedler","year":"1995","unstructured":"Friedler F, Varga J, Fan LT (1995) Decision-mapping: a tool for consistent and complete decisions in process synthesis. Chem Eng Sci 50:1755","journal-title":"Chem Eng Sci"},{"key":"576_CR20","doi-asserted-by":"crossref","unstructured":"Friedler F, Varga J, Feher E, Fan LT (1996) Combinatorially accelerated branch-and-bound method for solving the MIP model of process network synthesis. In: State of the art in global optimization, pp 609\u2013626","DOI":"10.1007\/978-1-4613-3437-8_35"},{"issue":"2","key":"576_CR21","first-page":"103","volume":"12","author":"JC Garc\u00eda-Ojeda","year":"2015","unstructured":"Garc\u00eda-Ojeda JC, Bertok B, Friedler F, Argoti A, Fan LT (2015) A preliminary study of the application of the P-graph methodology for organization-based multiagent system designs: assessment. Acta Polytech Hung 12(2):103\u2013122","journal-title":"Acta Polytech Hung"},{"key":"576_CR22","doi-asserted-by":"crossref","unstructured":"Honig U, Schiffmann W (2004) A parallel branch and bound algorithm for computing optimal task graph schedules. In: International conference on grid and cooperative computing, pp 18\u201325","DOI":"10.1007\/978-3-540-24680-0_3"},{"issue":"5","key":"576_CR23","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1016\/j.compchemeng.2009.11.020","volume":"34","author":"HL Lam","year":"2010","unstructured":"Lam HL, Varbanov PS, Kleme\u0161 JJ (2010) Optimisation of regional energy supply chains utilising renewables: P-graph approach. Comput Chem Eng 34(5):782\u2013792","journal-title":"Comput Chem Eng"},{"key":"576_CR24","doi-asserted-by":"crossref","unstructured":"Mezmaz M, Melab N, Tuyttens D (2013) A multithreaded branch-and-bound algorithm for solving the flow-shop problem on a multicore environment. In: Large scale network-centric distributed systems, pp 53\u201370","DOI":"10.1002\/9781118640708.ch03"},{"issue":"3","key":"576_CR25","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0167-6377(89)90038-2","volume":"8","author":"D Miller","year":"1989","unstructured":"Miller D, Pekny J (1989) Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem. Oper Res Lett 8(3):129\u2013135","journal-title":"Oper Res Lett"},{"issue":"2","key":"576_CR26","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-6377(88)90067-3","volume":"7","author":"EA Pruul","year":"1988","unstructured":"Pruul EA, Nemhauser GL, Rushmeier RA (1988) Branch-and-bound and parallel computation: a historical note. Oper Res Lett 7(2):65\u201369","journal-title":"Oper Res Lett"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0576-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-018-0576-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0576-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T12:43:02Z","timestamp":1569069782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-018-0576-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,17]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["576"],"URL":"https:\/\/doi.org\/10.1007\/s10100-018-0576-1","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2018,8,17]]},"assertion":[{"value":"17 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}