@article{MTMT:30761719,
	title = {Production line balancing by P-graphs},
	url = {https://m2.mtmt.hu/api/publication/30761719},
	author = {Bartos, Anikó and Bertók, Botond},
	doi = {10.1007/s11081-019-09462-1},
	journal-iso = {OPTIM ENG},
	journal = {OPTIMIZATION AND ENGINEERING},
	volume = {21},
	unique-id = {30761719},
	issn = {1389-4420},
	abstract = {Assembly industry plays a key role in Central and Eastern Europe. Large companies and their subcontractors manufacture automotive and electronic products from components, employing a significant number of human resources. Due to the growing labor shortage, it is critical that the production lines should be optimally loaded, i.e., the tasks have to be evenly distributed among the workstations according to their cycle times. In this article a novel formulation of the problem by process graphs or P-graphs is presented leading in an easy to follow visual definition of the potential task to employee allocations, as well as the options to generate a mathematical programming model algorithmically, to be solved by general purpose solvers or get the optimal and alternative N-best allocations by P-graph software. In addition to the theoretical presentation, the article shows the results achieved by applying the proposed methodology in a real-world environment in a computer assembly plant. The P-graph approach provides visual modeling by graphs in a graphical editor and helps understand the relations of decision variables while generating the corresponding mathematical model, which can be generalized for a class of problems and rebuilt according to actual data. As a result, the basis for rigorous mathematical optimization-based decision support can be built up according to graphical models easily understandable by end users as well.},
	year = {2020},
	eissn = {1573-2924},
	pages = {567-584},
	orcid-numbers = {Bartos, Anikó/0000-0002-6239-9278; Bertók, Botond/0000-0002-1297-9792}
}

@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:3404230,
	title = {Energy Consumption Optimization of a Manufacturing Plant by the Application of the P-Graph Framework},
	url = {https://m2.mtmt.hu/api/publication/3404230},
	author = {Éles, András and Halász, L and Heckl, István and Cabezas, Heriberto},
	doi = {10.3303/CET1870298},
	journal-iso = {CHEM ENG TR},
	journal = {CHEMICAL ENGINEERING TRANSACTIONS},
	volume = {70},
	unique-id = {3404230},
	issn = {1974-9791},
	year = {2018},
	eissn = {2283-9216},
	pages = {1783-1788}
}

@article{MTMT:2941212,
	title = {Process Synthesis involving multi-period operations by the p-graph framework},
	url = {https://m2.mtmt.hu/api/publication/2941212},
	author = {Heckl, István and Halász, László and Szlama, Adrián György and Cabezas, Heriberto and Friedler, Ferenc},
	doi = {10.1016/j.compchemeng.2015.04.037},
	journal-iso = {COMPUT CHEM ENG},
	journal = {COMPUTERS & CHEMICAL ENGINEERING},
	volume = {83},
	unique-id = {2941212},
	issn = {0098-1354},
	year = {2015},
	eissn = {1873-4375},
	pages = {157-164}
}

@article{MTMT:2509858,
	title = {Forty years of Heat Integration: Pinch Analysis (PA) and Mathematical Programming (MP)},
	url = {https://m2.mtmt.hu/api/publication/2509858},
	author = {Klemeš, Jiri Jaromir and Kravanja, Z},
	doi = {10.1016/j.coche.2013.10.003},
	journal-iso = {CURR OPIN CHEM ENG},
	journal = {CURRENT OPINION IN CHEMICAL ENGINEERING},
	volume = {2},
	unique-id = {2509858},
	issn = {2211-3398},
	abstract = {Process Integration (PI) supporting Process Design, Integration, and Optimisation has been around from the early 1970s. PI was developed originally from Heat Integration, which remains the cornerstone for PI continuous advance. It has been closely related to the development of Chemical, Mechanical and Power Engineering supported by the extended implementation of mathematical modelling, simulation and optimisation, and by the application of information technology. Its development has accelerated over the years as its methodology has been able to provide answers and support for important issues regarding economic development - better utilisation and savings regarding energy, water, and other resources. This contribution is targeting towards providing at least a short overview of its historical development, achievements, and future challenges. © 2013 Elsevier Ltd. All rights reserved.},
	year = {2013},
	eissn = {2211-3398},
	pages = {461-474}
}

@article{MTMT:2194049,
	title = {Synthesis of sustainable energy supply chain by the P-graph framework},
	url = {https://m2.mtmt.hu/api/publication/2194049},
	author = {Vance, L and Cabezas, Heriberto and Heckl, István and Bertók, Botond and Friedler, Ferenc},
	doi = {10.1021/ie3013264},
	journal-iso = {IND ENG CHEM RES},
	journal = {INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH},
	volume = {52},
	unique-id = {2194049},
	issn = {0888-5885},
	abstract = {The present work proposes a computer-aided methodology for 
		designing sustainable supply chains in terms of sustainability 
		metrics by utilizing the P-graph framework. The methodology is 
		an outcome of the collaboration between the Office of Research 
		and Development (ORD) of the U.S. EPA and the research group led 
		by the creators of the P-graph framework at the University of 
		Pannonia. The integration of supply chain design and 
		sustainability is the main focus of this collaboration. The P-
		graph framework provides a mathematically rigorous procedure for 
		synthesizing optimal and alternative suboptimal networks subject 
		to multiple objectives and constraints, which include 
		profitability and sustainability in the proposed methodology. 
		Specifically, to evaluate the sustainability of a given process 
		under construction including its supply chain, sustainability 
		metrics are incorporated into the design procedure. The proposed 
		methodology is demonstrated with the optimal design of a supply 
		chain for providing heat and electric power to an agricultural 
		region with relatively limited land area where agricultural 
		wastes can potentially be recovered as renewable resources. The 
		objective functions for optimization comprise the profit and the 
		ecological footprint. The results of the study indicate that, 
		compared to using electricity from the grid and/or natural gas, 
		using renewable energy resources can yield substantial cost 
		reductions of up to 5%, as well as significant ecological 
		footprint reductions of up to 77%. It may, therefore, be 
		possible to design more sustainable supply chains that are both 
		cost-effective and less environmentally damaging. © 2012 
		American Chemical Society.},
	year = {2013},
	eissn = {1520-5045},
	pages = {266-274},
	orcid-numbers = {Bertók, Botond/0000-0002-1297-9792}
}

@article{MTMT:2635739,
	title = {Optimization of Desalination Location Problem Using MILP},
	url = {https://m2.mtmt.hu/api/publication/2635739},
	author = {Emhamed, A M and Czuczai, B and Horvath, L and Rév, Endre and Lelkes, Zoltán},
	doi = {10.1002/aic.11255},
	journal-iso = {AICHE J},
	journal = {AICHE JOURNAL},
	volume = {53},
	unique-id = {2635739},
	issn = {0001-1541},
	abstract = {A new mixed-integer linear programming model for location problem is developed in this work in order to find the optimal co-ordinates of the desalination plants. The model takes into account the given locations and capacities of the water incomes, the demands, and the costs of plants and pipelining. Feasible and infeasible plant regions are distinguished for locating the plants. The model has been developed in two consecutive phases. First, a basic model is developed that provides a solution within short time but does not take into account the possibility of pipeline branching. Application of this model gives rise to redundant pipelines to some connections, involving extra costs. Pipeline branching is dealt with an improved model developed in the second phase. This improved model provides realistic solution but with much longer computation time. The results of applying the different models on motivated examples of different sizes are detailed. (C) 2007 American Institute of Chemical Engineers.},
	year = {2007},
	eissn = {1547-5905},
	pages = {2367-2383}
}

@article{MTMT:1044778,
	title = {Holistic approach to process retrofitting: Application to downstream process for biochemical production of organics},
	url = {https://m2.mtmt.hu/api/publication/1044778},
	author = {Liu, J and Fan, L T and Seib, P and Friedler, Ferenc and Bertók, Botond},
	doi = {10.1021/ie051014m},
	journal-iso = {IND ENG CHEM RES},
	journal = {INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH},
	volume = {45},
	unique-id = {1044778},
	issn = {0888-5885},
	year = {2006},
	eissn = {1520-5045},
	pages = {4200-4207},
	orcid-numbers = {Bertók, Botond/0000-0002-1297-9792}
}

@article{MTMT:2647490,
	title = {Process flowsheet superstructures: Structural multiplicity and redundancy part I: Basic GDP and MINLP representations},
	url = {https://m2.mtmt.hu/api/publication/2647490},
	author = {Farkas, T and Rév, Endre and Lelkes, Z},
	doi = {10.1016/j.compchemeng.2005.07.007},
	journal-iso = {COMPUT CHEM ENG},
	journal = {COMPUTERS & CHEMICAL ENGINEERING},
	volume = {29},
	unique-id = {2647490},
	issn = {0098-1354},
	abstract = {Structural multiplicity has a significant effect on the solution of an MINLP model for process synthesis problems. The optimization model may also have built-in redundancy that cannot always be directly derived from the multiplicity of the superstructure. A basic GDP representation (BGR) involving logical relations is defined, and can be constructed by applying a standard natural representation of the process. Basic MINLP representation (BMR) is defined by transforming the logical relations to algebraic ones. MINLP representation (MR) is defined through a fixed form of BMR. Equivalency and representativeness of MR-s in general form can be analyzed by reducing them to their BMRs. BMR can be automatically generated, and can serve as a reference representation. Binary and continuous multiplicity of MR are defined. If the supergraph, i.e. the graph representing the superstructure, is structurally redundant (i.e. there are isomorphic graphs amongst their subgraphs) then BMR has binary multiplicity. Conversely, the structural redundancy of the graph does not follow from the binary multiplicity of its BMR. Different kinds of multiplicity and redundancy measures of the MINLP representation will be defined in Part 11 of this series in order to help inventing tools for decreasing their detrimental effect. Alternative MINLP representations will there be defined, constructed, and compared from the viewpoint of ideality, minimality, and solution properties. (c) 2005 Elsevier Ltd. All rights reserved.},
	year = {2005},
	eissn = {1873-4375},
	pages = {2180-2197}
}

@article{MTMT:2647491,
	title = {Process flowsheet superstructures: Structural multiplicity and redundancy Part II: Ideal and binarily minimal MINLP representations},
	url = {https://m2.mtmt.hu/api/publication/2647491},
	author = {Farkas, T and Rév, Endre and Lelkes, Z},
	doi = {10.1016/j.compchemeng.2005.07.008},
	journal-iso = {COMPUT CHEM ENG},
	journal = {COMPUTERS & CHEMICAL ENGINEERING},
	volume = {29},
	unique-id = {2647491},
	issn = {0098-1354},
	abstract = {The essential problems, namely representativeness and uniqueness, in defining mixed integer non-linear programming (MINLP) representation (MR) is solved in Part I by first defining a basic MR (BMR) that: (1) can be automatically constructed from an easier formable standard GDP representation and (2) serves as a reference representation. Binary and continuous multiplicity of MR are also defined in Part I, and relation is given there between structural redundancy and binary multiplicity. Based on this results, ideal and binarily minimal MR-s are defined, and the different MR-s are compared from numerical point of view in the present (and final) part. Ideal MR represents all the considered structures and not any other structure. Supposing the process graphs are distincted using binary variables, binarily minimal MR uses the minimal number of them. Solvability of the different MR-s, including some combined versions, are tested on a middle scale and an industrial scale process synthesis problems. Total solution time, solution time for subproblems, number of iterations, non-ideality and scale of the solvable problems are compared. Idealization of the representation and decreasing the number of binary variables, as suggested in the article, both enhance the solvability and decrease the solution time in a great extent. (c) 2005 Elsevier Ltd. All riahts reserved.},
	year = {2005},
	eissn = {1873-4375},
	pages = {2198-2214}
}

@inproceedings{MTMT:236103,
	title = {R-Graph-Based Distillation Column Superstructure and MINLP Model},
	url = {https://m2.mtmt.hu/api/publication/236103},
	author = {Farkas, Tivadar and Rév, Endre and Czuczai, B and Fonyó, Zsolt and Lelkes, Zoltán},
	booktitle = {European Symposium on Computer-Aided Process Engineering-15, 20A and 20B},
	unique-id = {236103},
	year = {2005},
	pages = {889}
}

@article{MTMT:2647495,
	title = {Handling of removable discontinuities in MINLP models for process synthesis problems, formulations of the Kremser equation},
	url = {https://m2.mtmt.hu/api/publication/2647495},
	author = {Szitkai, Z and Lelkes, Z and Rév, Endre and Fonyó, Zsolt},
	doi = {10.1016/S0098-1354(02)00037-6},
	journal-iso = {COMPUT CHEM ENG},
	journal = {COMPUTERS & CHEMICAL ENGINEERING},
	volume = {26},
	unique-id = {2647495},
	issn = {0098-1354},
	abstract = {This paper presents a new method for handling removable discontinuities in non-convex mixed integer non-linear programming (MINLP) models for chemical process synthesis and design. First, the occurrences of different kinds of discontinuities in design equations are discussed. Then methods so far developed for handling discontinuities in an MINLP design environment are summarized. In the main part of the paper, a new method is presented for handling removable discontinuities. Our new method is compared to five conventional literature methods applied to three mass exchange network synthesis problems of different size, where the Kremser equation is used for calculating the number of equilibrium stages. In addition, a heat exchange network synthesis problem is considered where the logarithmic mean temperature difference is calculated rigorously. Our method proved to be much faster than the other methods examined and shows less sensitivity to the change of initial values in terms of optimal objective function value and solution time. (C) 2002 Elsevier Science Ltd. All rights reserved.},
	year = {2002},
	eissn = {1873-4375},
	pages = {1501-1516}
}

@article{MTMT:1044835,
	title = {Combinatorial foundation for logical formulation in process network synthesis},
	url = {https://m2.mtmt.hu/api/publication/1044835},
	author = {Brendel, M H and Friedler, Ferenc and Fan, L T},
	doi = {10.1016/S0098-1354(00)00569-X},
	journal-iso = {COMPUT CHEM ENG},
	journal = {COMPUTERS & CHEMICAL ENGINEERING},
	volume = {24},
	unique-id = {1044835},
	issn = {0098-1354},
	year = {2000},
	eissn = {1873-4375},
	pages = {1859-1864}
}

@inbook{MTMT:1049662,
	title = {Combinatorially Accelerated Branch-and-Bound Method for Solving the MIP Model of Process Network Synthesis},
	url = {https://m2.mtmt.hu/api/publication/1049662},
	author = {Friedler, Ferenc and Varga, József and Feher, E and Fan, L T},
	booktitle = {Nonconvex Optimization and Its Applications, State of the Art in Global Optimization, Computational Methods and Applications},
	unique-id = {1049662},
	year = {1996},
	pages = {609-626}
}

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