@article{MTMT:31609072,
	title = {Socio-ecological network structures from process graphs},
	url = {https://m2.mtmt.hu/api/publication/31609072},
	author = {Lao, Angelyn and Cabezas, Heriberto and Orosz, Ákos and Friedler, Ferenc and Tan, Raymond},
	doi = {10.1371/journal.pone.0232384},
	journal-iso = {PLOS ONE},
	journal = {PLOS ONE},
	volume = {15},
	unique-id = {31609072},
	issn = {1932-6203},
	year = {2020},
	eissn = {1932-6203}
}

@article{MTMT:31609075,
	title = {Multiple-solution heat exchanger network synthesis for enabling the best industrial implementation},
	url = {https://m2.mtmt.hu/api/publication/31609075},
	author = {Orosz, Ákos and Friedler, Ferenc},
	doi = {10.1016/j.energy.2020.118330},
	journal-iso = {ENERGY},
	journal = {ENERGY},
	volume = {208},
	unique-id = {31609075},
	issn = {0360-5442},
	year = {2020},
	eissn = {1873-6785}
}

@article{MTMT:31361333,
	title = {Managing Alternative Patient Appointments Using P-Graph Methodology},
	url = {https://m2.mtmt.hu/api/publication/31361333},
	author = {Süle, Zoltán and Baumgartner, János and Fogarassyné Vathy, Ágnes},
	doi = {10.3233/SHTI200074},
	journal-iso = {STUD HEALTH TECHNOL INFORM},
	journal = {STUDIES IN HEALTH TECHNOLOGY AND INFORMATICS},
	volume = {271},
	unique-id = {31361333},
	issn = {0926-9630},
	abstract = {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.},
	keywords = {decision support system; Appointments and Schedules; medical process optimisation; process graph},
	year = {2020},
	eissn = {1879-8365},
	pages = {57-64},
	orcid-numbers = {Fogarassyné Vathy, Ágnes/0000-0002-5524-1675}
}

@article{MTMT:30920524,
	title = {Prospects and challenges for chemical process synthesis with P-graph},
	url = {https://m2.mtmt.hu/api/publication/30920524},
	author = {Friedler, Ferenc and Bertók, Botond and Foo, Dominic CY and Tan, Raymond R},
	doi = {10.1016/j.coche.2019.08.007},
	journal-iso = {CURR OPIN CHEM ENG},
	journal = {CURRENT OPINION IN CHEMICAL ENGINEERING},
	volume = {26},
	unique-id = {30920524},
	issn = {2211-3398},
	year = {2019},
	eissn = {2211-3398},
	pages = {58-64},
	orcid-numbers = {Bertók, Botond/0000-0002-1297-9792}
}

@article{MTMT:1044846,
	title = {Graph-Theoretic Approach to Process Synthesis: Polynomial Algorithm for Maximal Structure Generation},
	url = {https://m2.mtmt.hu/api/publication/1044846},
	author = {Friedler, Ferenc and Tarján, Klára and Huang, Y W and Fan, L T},
	doi = {10.1016/0098-1354(93)80074-W},
	journal-iso = {COMPUT CHEM ENG},
	journal = {COMPUTERS & CHEMICAL ENGINEERING},
	volume = {17},
	unique-id = {1044846},
	issn = {0098-1354},
	year = {1993},
	eissn = {1873-4375},
	pages = {929-942}
}

@article{MTMT:1044848,
	title = {Combinatorial Algorithms for Process Synthesis},
	url = {https://m2.mtmt.hu/api/publication/1044848},
	author = {Friedler, Ferenc and Tarján, Klára and Huang, Y W and Fan, L T},
	doi = {10.1016/S0098-1354(09)80037-9},
	journal-iso = {COMPUT CHEM ENG},
	journal = {COMPUTERS & CHEMICAL ENGINEERING},
	volume = {16},
	unique-id = {1044848},
	issn = {0098-1354},
	year = {1992},
	eissn = {1873-4375},
	pages = {S313-S320}
}