@article{MTMT:34484148,
	title = {Energy Management Systems in Smart Cities: A Review from the Perspective of Complex Networks Design},
	url = {https://m2.mtmt.hu/api/publication/34484148},
	author = {Pimentel, Jean and Lukács, Balázs and Drotár, István},
	doi = {10.3303/CET23107114},
	journal-iso = {CHEM ENG TR},
	journal = {CHEMICAL ENGINEERING TRANSACTIONS},
	volume = {107},
	unique-id = {34484148},
	issn = {1974-9791},
	year = {2023},
	eissn = {2283-9216},
	pages = {679-684},
	orcid-numbers = {Pimentel, Jean/0000-0003-3359-4848}
}

@article{MTMT:34473848,
	title = {Systematic Energy Optimization and Design of Process Alternatives for Separation of Quaternary Azeotropic Mixtures},
	url = {https://m2.mtmt.hu/api/publication/34473848},
	author = {Pimentel, Jean and Mizsey, Péter},
	doi = {10.3303/CET23107096},
	journal-iso = {CHEM ENG TR},
	journal = {CHEMICAL ENGINEERING TRANSACTIONS},
	volume = {107},
	unique-id = {34473848},
	issn = {1974-9791},
	year = {2023},
	eissn = {2283-9216},
	pages = {571-576},
	orcid-numbers = {Pimentel, Jean/0000-0003-3359-4848; Mizsey, Péter/0000-0002-6976-6210}
}

@article{MTMT:34202437,
	title = {Technoeconomic Assessment of Recycling Routes for Chemicals: A Case Study of n-Hexane},
	url = {https://m2.mtmt.hu/api/publication/34202437},
	author = {Pimentel, Jean and Gerardo, Ruiz-Mercadob and Friedler, Ferenc},
	doi = {10.3303/CET23103059},
	journal-iso = {CHEM ENG TR},
	journal = {CHEMICAL ENGINEERING TRANSACTIONS},
	volume = {103},
	unique-id = {34202437},
	issn = {1974-9791},
	abstract = {The circular economy has become one of the most popular topics in worldwide sustainability research. The  imperious necessity of reducing resource consumption and decreasing waste generation has led to reincorporating materials at the end-of-life (EoL) stage into the productive chain. Nonetheless, the presence of hazardous substances in the EoL stage materials poses a significant challenge for the transition toward the production model. The adequate transformation of these materials into feedstocks requires their correct allocation into recovery plants and final destinations. Such an allocation can be decided by resorting to 
		optimisation by generating the best alternative networks, from where the stakeholders may decide the most suitable recycling scheme. In this work, a graph-theoretic approach is introduced to identify the best alternatives to reincorporate industrial EoL chemicals into the productive chain. This contribution presents the initial approach to this problem, demonstrated through a case study considering the data reported on the public-access release inventory data for n-hexane. Different recycling routes are proposed for the case study by optimising the total treatment cost, and their advantages and disadvantages are discussed; moreover, their efficiency concerning the circular economy is measured by comparing the amount of recovered chemicals. By generating plausible recycling alternatives, this work contributes positively to analysing potential alternatives for circular economy and resource conservation in industry.},
	year = {2023},
	eissn = {2283-9216},
	pages = {349-354},
	orcid-numbers = {Pimentel, Jean/0000-0003-3359-4848}
}

@article{MTMT:34064369,
	title = {Optimization of vertical farms energy efficiency via multiperiodic graph-theoretical approach},
	url = {https://m2.mtmt.hu/api/publication/34064369},
	author = {Pimentel, Jean and Balázs, László and Friedler, Ferenc},
	doi = {10.1016/j.jclepro.2023.137938},
	journal-iso = {J CLEAN PROD},
	journal = {JOURNAL OF CLEANER PRODUCTION},
	volume = {416},
	unique-id = {34064369},
	issn = {0959-6526},
	year = {2023},
	eissn = {1879-1786},
	orcid-numbers = {Pimentel, Jean/0000-0003-3359-4848; Balázs, László/0000-0001-7319-9389}
}

@article{MTMT:34016282,
	title = {A comprehensive, semi-automated systematic literature review (SLR) design: Application to P-graph research with a focus on sustainability},
	url = {https://m2.mtmt.hu/api/publication/34016282},
	author = {Tóth, Árpád and Suta, Alex and Pimentel, Jean and Argoti, Andres},
	doi = {10.1016/j.jclepro.2023.137741},
	journal-iso = {J CLEAN PROD},
	journal = {JOURNAL OF CLEANER PRODUCTION},
	volume = {415},
	unique-id = {34016282},
	issn = {0959-6526},
	year = {2023},
	eissn = {1879-1786},
	orcid-numbers = {Pimentel, Jean/0000-0003-3359-4848; Argoti, Andres/0000-0001-7275-3253}
}

@article{MTMT:33204707,
	title = {Enabling technology models with nonlinearities in the synthesis of wastewater treatment networks based on the P-graph framework},
	url = {https://m2.mtmt.hu/api/publication/33204707},
	author = {Pimentel, Jean and Aboagye, Emmanuel and Orosz, Ákos and Markót, Mihály Csaba and Cabezas, Heriberto and Friedler, Ferenc and Yenkie, Kirti M.},
	doi = {10.1016/j.compchemeng.2022.108034},
	journal-iso = {COMPUT CHEM ENG},
	journal = {COMPUTERS & CHEMICAL ENGINEERING},
	volume = {167},
	unique-id = {33204707},
	issn = {0098-1354},
	abstract = {Designing effective wastewater treatment networks is challenging because of the large number of treatment options available for performing similar tasks. Each treatment option has variability in cost and contaminant removal efficiency. Moreover, their mathematical models are highly nonlinear, thus rendering them computationally intensive. Such systems yield mixed-integer nonlinear programming models which cannot be solved properly with contemporary optimization tools that may result in local optima or may fail to converge. Herein, the P-graph framework is employed, thus generating all potentially feasible process structures, which results in simpler, smaller mathematical models. All potentially feasible process networks are evaluated by nonlinear programming resulting in guaranteed global optimum; furthermore, the ranked list of the n-best networks is also available. With the proposed tool, better facilities can be designed handling complex waste streams with minimal cost and reasonable environmental impact. The novel method is illustrated with two case studies showing its computational effectiveness.},
	year = {2022},
	eissn = {1873-4375},
	orcid-numbers = {Pimentel, Jean/0000-0003-3359-4848; Markót, Mihály Csaba/0000-0002-0747-6242; Yenkie, Kirti M./0000-0002-8044-0369}
}

@article{MTMT:33154664,
	title = {Synthesis of Integrated Vertical Farming Systems with Multiperiodic Resource Availability},
	url = {https://m2.mtmt.hu/api/publication/33154664},
	author = {Pimentel, Jean and Friedler, Ferenc},
	doi = {10.3303/CET2294173},
	journal-iso = {CHEM ENG TR},
	journal = {CHEMICAL ENGINEERING TRANSACTIONS},
	volume = {94},
	unique-id = {33154664},
	issn = {1974-9791},
	year = {2022},
	eissn = {2283-9216},
	pages = {1039-1044},
	orcid-numbers = {Pimentel, Jean/0000-0003-3359-4848}
}

@article{MTMT:33116760,
	title = {Framework to Embed Machine Learning Algorithms in P-graph: Communication from the Chemical Process Perspectives},
	url = {https://m2.mtmt.hu/api/publication/33116760},
	author = {Teng, Sin Yong and Orosz, Ákos and How, Bing Shen and Pimentel, Jean and Friedler, Ferenc and Jansen, Jeroen J.},
	doi = {10.1016/j.cherd.2022.09.043},
	journal-iso = {CHEM ENG RES DES},
	journal = {CHEMICAL ENGINEERING RESEARCH AND DESIGN},
	volume = {188},
	unique-id = {33116760},
	issn = {0263-8762},
	abstract = {P-graph is a popularly used framework for process network synthesis (PNS) and network topological optimization. This short communication introduces a Python interface for P-graph to serve as a linkage to modern programming ecosystems. This allows for a wider application of the fast and efficient P-graph solver, to provide structural and topological enumeration in numerous fields. The proposed framework allows for more integrative usage in Artificial Intelligence (AI), machine learning, process system engineering, chemical engineering and chemometrics. Large and repetitive topologies can also be automated using the new programming interface, saving time and effort in modelling. This short communication serves as a demonstration of the newly developed open-sourced P-graph interface.},
	year = {2022},
	eissn = {1744-3563},
	pages = {265-270},
	orcid-numbers = {Pimentel, Jean/0000-0003-3359-4848}
}

@article{MTMT:33034254,
	title = {General formulation of resilience for designing process networks},
	url = {https://m2.mtmt.hu/api/publication/33034254},
	author = {Orosz, Ákos and Pimentel, Jean and Argoti, Andres and Friedler, Ferenc},
	doi = {10.1016/j.compchemeng.2022.107932},
	journal-iso = {COMPUT CHEM ENG},
	journal = {COMPUTERS & CHEMICAL ENGINEERING},
	volume = {165},
	unique-id = {33034254},
	issn = {0098-1354},
	abstract = {Herein, the formula proposed for quantifying the resilience of engineering systems, including processing systems, is general in several aspects. The structure of a system can be highly complex where the numbers of loops, raw materials, and products are not limited. The mathematical models of the operating units can be either linear or nonlinear for simulating the effect of the failures. The damage caused by an unexpected event can result in various levels of operation for the operating units. The proposed formula is also general in the sense that all possible combinations of failures are considered. The problem formulation, the related structure representation, the enumeration and evaluation of possible failures are based on the P-graph framework and its algorithms. The proposed formula for resilience is applicable to any complex engineering system whose behavior is primarily determined by its structure, including supply chains, information systems, municipal infrastructures, and electrical transmission networks.},
	year = {2022},
	eissn = {1873-4375},
	orcid-numbers = {Orosz, Ákos/0000-0001-8064-4487; Pimentel, Jean/0000-0003-3359-4848}
}

@book{MTMT:32681060,
	title = {P-graphs for process systems engineering: Mathematical models and algorithms},
	url = {https://m2.mtmt.hu/api/publication/32681060},
	isbn = {9783030922153},
	author = {Friedler, Ferenc and Orosz, Ákos and Pimentel, Jean},
	doi = {10.1007/978-3-030-92216-0},
	publisher = {Springer Netherlands},
	unique-id = {32681060},
	year = {2022},
	orcid-numbers = {Pimentel, Jean/0000-0003-3359-4848}
}