Heuristics for Simplified Process Network Synthesis (PNS) Problems with a Blossom-Type Algorithm for the Edge Covering Problem
| Title | Heuristics for Simplified Process Network Synthesis (PNS) Problems with a Blossom-Type Algorithm for the Edge Covering Problem |
| Publication Type | Book Chapter |
| Year of Publication | 2001 |
| Authors | Blázsik Z, Keserű K, Kovács Z |
| Editor | Giannessi F, Pardalos P, Rapcsák T |
| Book Title | Optimization Theory: Recent Developments from Mátraháza |
| Pagination | 19–31 |
| Publisher | Springer US |
| Place Published | Boston, MA |
| ISBN Number | 978-1-4613-0295-7 |
| Abstract | Every Process Network Synthesis Problem (PNS) can be transformed into a simplified form. This simplified form consist of simple operating units in which the total number of input and output materials is at most 3. This observation facilitates useful application of the Edge Covering Problem of weighted graphs, which can be used to develop a new heuristic procedure for the PNS problem. |
| URL | https://doi.org/10.1007/978-1-4613-0295-7_2 |
| DOI | 10.1007/978-1-4613-0295-7_2 |