Comparing structural constraints for Accelerated Branch and Bound solver of process network synthesis problems
The P-Graph methodology can be used to find the optimal solution for large processing system. This methodology solves the combinatorial part of the problem more efficiently than the traditional branch and bound method due to the utilized relationships inherent in the structure. However, reducing the...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
University of Szeged, Institute of Informatics
Szeged
2024
|
| Sorozat: | Acta cybernetica
26 No. 3 |
| Kulcsszavak: | P-graph módszertan, Folyamatoptimalizálás |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.297735 |
| Online Access: | http://acta.bibl.u-szeged.hu/86982 |
| LEADER | 01535nab a2200253 i 4500 | ||
|---|---|---|---|
| 001 | acta86982 | ||
| 005 | 20250415154733.0 | ||
| 008 | 250415s2024 hu o 000 eng d | ||
| 022 | |a 2676-993X | ||
| 024 | 7 | |a 10.14232/actacyb.297735 |2 doi | |
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Heinc Emília | |
| 245 | 1 | 0 | |a Comparing structural constraints for Accelerated Branch and Bound solver of process network synthesis problems |h [elektronikus dokumentum] / |c Heinc Emília |
| 260 | |a University of Szeged, Institute of Informatics |b Szeged |c 2024 | ||
| 300 | |a 475-499 | ||
| 490 | 0 | |a Acta cybernetica |v 26 No. 3 | |
| 520 | 3 | |a The P-Graph methodology can be used to find the optimal solution for large processing system. This methodology solves the combinatorial part of the problem more efficiently than the traditional branch and bound method due to the utilized relationships inherent in the structure. However, reducing the number of possibilities developed in the constraint functions also plays a major role in this algorithm. In this publication, we present a new constraint function that also takes into account the minimum cost structure and compares it with earlier versions. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Matematika | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a P-graph módszertan, Folyamatoptimalizálás | ||
| 700 | 0 | 1 | |a Bánhelyi Balázs |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/86982/1/cybernetica_026_numb_003_475-499.pdf |z Dokumentum-elérés |