Holló Csaba and Blázsik Zoltán and Imreh Balázs and Kovács Z.: On a merging reduction of the process network synthesis problem. In: Acta cybernetica, (14) 2. pp. 251-261. (1999)
Preview |
Cikk, tanulmány, mű
cybernetica_014_numb_002_251-261.pdf Download (1MB) | Preview |
Abstract
Since the combinatorial version of the process network synthesis (PNS) problem is NP-complete, it is important to establish such methods which render possible the reduction of the size of model. In this work, a new method called merging reduction is introduced which is based on the merging of operating units. The mergeable operating units are determined by an equivalence relation on the set of the operating units, and all of the operating units included in an equivalence class are merged into one new operating unit. This reduction has the following property: an optimal solution of the original problem can be derived from an optimal solution of the reduced problem and conversely. Presentation of this reduction technique is equipped with an empirical analysis on randomly generated problems which shows the measure of the size decrease.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1999 |
| Volume: | 14 |
| Number: | 2 |
| ISSN: | 0324-721X |
| Page Range: | pp. 251-261 |
| Language: | English |
| Place of Publication: | Szeged |
| Event Title: | Conference for PhD Students in Computer Science (1.) (1998) (Szeged) |
| Related URLs: | http://acta.bibl.u-szeged.hu/38508/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: 261. p. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:26 |
| Last Modified: | 2022. Jun. 14. 08:46 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12625 |
Actions (login required)
 |
View Item |
