@article{MTMT:27624043,
	title = {Towards generalized process networks: Prospective new research frontiers for the p-graph framework},
	url = {https://m2.mtmt.hu/api/publication/27624043},
	author = {Tan, RR and Aviso, KB and Klemeš, JJ and Lam, HL and Varbanov, PS and Friedler, Ferenc},
	doi = {10.3303/CET1870016},
	journal-iso = {CHEM ENG TR},
	journal = {CHEMICAL ENGINEERING TRANSACTIONS},
	volume = {70},
	unique-id = {27624043},
	issn = {1974-9791},
	year = {2018},
	eissn = {2283-9216},
	pages = {91-96}
}

@article{MTMT:26874851,
	title = {Process network design and optimisation using P-graph: The success, the challenges and potential roadmap},
	url = {https://m2.mtmt.hu/api/publication/26874851},
	author = {Varbanov, PS and Friedler, Ferenc and Klemeš, JJ},
	doi = {10.3303/CET1761256},
	journal-iso = {CHEM ENG TR},
	journal = {CHEMICAL ENGINEERING TRANSACTIONS},
	volume = {61},
	unique-id = {26874851},
	issn = {1974-9791},
	year = {2017},
	eissn = {2283-9216},
	pages = {1549-1554}
}

@inproceedings{MTMT:3025550,
	title = {Spreading the Message: P-Graph Enhancements: Implementations and Applications},
	url = {https://m2.mtmt.hu/api/publication/3025550},
	author = {Klemeš, Jiri Jaromir and Varbanov, Petar},
	booktitle = {PRES15: PROCESS INTEGRATION, MODELLING AND OPTIMISATION FOR ENERGY SAVING AND POLLUTION REDUCTION},
	doi = {10.3303/CET1545223},
	unique-id = {3025550},
	abstract = {P-graph is a combinatorial optimisation framework aimed at optimising process networks. It is particularly efficient in handling problems with high combinatorial complexity and it has shown great reduction in the computational burden related to that. The current contribution provides a critical review of the P-graph framework, its fundamentals, main application areas and influence on the scientific and engineering thoughts for solving complicated real-life problems. This is followed by an analysis of the achieved impact, results and limitations. Potential opportunities for future research, development and innovation, opened by the identified limitations, are then suggested and discussed.},
	year = {2015},
	pages = {1333-1338}
}

@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}
}

@article{MTMT:1044849,
	title = {Graph-Theoretic Approach to Process Synthesis: Axioms and Theorems},
	url = {https://m2.mtmt.hu/api/publication/1044849},
	author = {Friedler, Ferenc and Tarján, Klára and Huang, Y W and Fan, L T},
	doi = {10.1016/0009-2509(92)80315-4},
	journal-iso = {CHEM ENG SCI},
	journal = {CHEMICAL ENGINEERING SCIENCE},
	volume = {47},
	unique-id = {1044849},
	issn = {0009-2509},
	year = {1992},
	eissn = {1873-4405},
	pages = {1973-1988}
}