TY - JOUR AU - Lao, Angelyn AU - Cabezas, Heriberto AU - Orosz, Ákos AU - Friedler, Ferenc AU - Tan, Raymond TI - Socio-ecological network structures from process graphs JF - PLOS ONE J2 - PLOS ONE VL - 15 PY - 2020 IS - 8 PG - 18 SN - 1932-6203 DO - 10.1371/journal.pone.0232384 UR - https://m2.mtmt.hu/api/publication/31609072 ID - 31609072 LA - English DB - MTMT ER - TY - JOUR AU - Orosz, Ákos AU - Friedler, Ferenc TI - Multiple-solution heat exchanger network synthesis for enabling the best industrial implementation JF - ENERGY J2 - ENERGY VL - 208 PY - 2020 SN - 0360-5442 DO - 10.1016/j.energy.2020.118330 UR - https://m2.mtmt.hu/api/publication/31609075 ID - 31609075 N1 - Department of Computer Science and Systems Technology, University of Pannonia, Egyetem u. 10, Veszprém, 8200, Hungary Pázmány Péter Catholic University, Szentkirályi u. 28, Budapest, 1088, Hungary Széchenyi István University, Egyetem tér 1, Győr, 9026, Hungary Cited By :24 Export Date: 18 November 2022 CODEN: ENEYD Correspondence Address: Friedler, F.; Széchenyi István University, Egyetem tér 1, Hungary; email: f.friedler@ga.sze.hu LA - English DB - MTMT ER - TY - JOUR AU - Süle, Zoltán AU - Baumgartner, János AU - Fogarassyné Vathy, Ágnes TI - Managing Alternative Patient Appointments Using P-Graph Methodology JF - STUDIES IN HEALTH TECHNOLOGY AND INFORMATICS J2 - STUD HEALTH TECHNOL INFORM VL - 271 PY - 2020 SP - 57 EP - 64 PG - 8 SN - 0926-9630 DO - 10.3233/SHTI200074 UR - https://m2.mtmt.hu/api/publication/31361333 ID - 31361333 N1 - WoS:hiba:000719574300008 2022-12-21 18:39 típus nem egyezik AB - Background: Patient appointment scheduling is one of the main challenging tasks in the healthcare administration and is constantly in the focus of theoretical researches. Objectives: The aim of this study was to investigate the applicability of the P-graph (Process graph) methodology to find the n-best alternative for patient's scheduling. Methods: The patient appointment scheduling task was formalised as an integer linear programming problem and was considered as a process network synthesis problem. The optimal and n-best alternative solutions were determined by an efficient branch and bound algorithm implemented in a decision support system. Results: Experimental results show, that the P-graph methodology can be effectively applied to produce the optimal scheduling for the examinations and to find the alternatives of the best scheduling. LA - English DB - MTMT ER - TY - JOUR AU - Friedler, Ferenc AU - Bertók, Botond AU - Foo, Dominic CY AU - Tan, Raymond R TI - Prospects and challenges for chemical process synthesis with P-graph JF - CURRENT OPINION IN CHEMICAL ENGINEERING J2 - CURR OPIN CHEM ENG VL - 26 PY - 2019 SP - 58 EP - 64 PG - 7 SN - 2211-3398 DO - 10.1016/j.coche.2019.08.007 UR - https://m2.mtmt.hu/api/publication/30920524 ID - 30920524 N1 - Pázmány Péter Catholic University, Szentkirályi utca 28, Budapest, 1088, Hungary De La Salle University, 2401 Taft Avenue, Manila, 0922, Philippines University of Pannonia, Egyetem u. 10, Veszprém, 8200, Hungary The University of Nottingham Malaysia, Jalan Broga, Semenyih, Selangor 43500, Malaysia Cited By :35 Export Date: 18 November 2022 LA - English DB - MTMT ER - TY - JOUR AU - Friedler, Ferenc AU - Tarján, Klára AU - Huang, Y W AU - Fan, L T TI - Graph-Theoretic Approach to Process Synthesis: Polynomial Algorithm for Maximal Structure Generation JF - COMPUTERS & CHEMICAL ENGINEERING J2 - COMPUT CHEM ENG VL - 17 PY - 1993 SP - 929 EP - 942 PG - 14 SN - 0098-1354 DO - 10.1016/0098-1354(93)80074-W UR - https://m2.mtmt.hu/api/publication/1044846 ID - 1044846 N1 - Department of Systems Engineering, Research Institute of Chemical Engineering, Hungarian Academy of Sciences, Veszprém, Pf. 125, 8201, Hungary Department of Mathematics, University of Veszprém, Veszprém, Hungary Department of Chemical Engineering, Kansas State University, Manhattan, KS 66506, United States Cited By :258 Export Date: 16 October 2023 CODEN: CCEND Correspondence Address: Friedler, F. Funding details: U.S. Environmental Protection Agency, EPA, R-815709 Funding text 1: pendently verifying its mathematical contents. Although the research in this article has been funded in part by the U.S. Environmental Protection Agency under assistance agreement R-815709 to the Great Plains/Rocky Mountain Hazardous Substance Research Center with headquarters at Kansas State University, it has not been subjected to the Aaencv’s Deer and administrative review and therefore may not ne&s~arily reflect the views of the Agency and no official endorsement should be inferred. This research was partially supported by the Hungarian Academy of Sciences and Kansas State University Center for Hazardous Substance. Research. LA - English DB - MTMT ER - TY - JOUR AU - Friedler, Ferenc AU - Tarján, Klára AU - Huang, Y W AU - Fan, L T TI - Combinatorial Algorithms for Process Synthesis JF - COMPUTERS & CHEMICAL ENGINEERING J2 - COMPUT CHEM ENG VL - 16 PY - 1992 SP - S313 EP - S320 SN - 0098-1354 DO - 10.1016/S0098-1354(09)80037-9 UR - https://m2.mtmt.hu/api/publication/1044848 ID - 1044848 N1 - Cited By :204 Export Date: 16 October 2023 Correspondence Address: Fan, L.T.; Laboratory for Artificial Intelligence in Process Engineering Department of Chemical Engineering, , Kansas, 66506, United States Funding details: U.S. Environmental Protection Agency, EPA Funding details: Kansas State University, KSU Funding text 1: Although the research in this article has been funded in part by the U.S. Environmental Protection Agency under assistance agreement headquarters at Kansas State University, it has not been subjected to the and therefore may not necessarily reflect the views of the Agency and no official endorsement should be inferred. This research was partially supported by Kansas State University Center for Hazardous Substance Research. LA - English DB - MTMT ER -