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.
