Comparing Structural Constraints for Accelerated Branch and Bound Solver of Process Network Synthesis Problems
DOI:
https://doi.org/10.14232/actacyb.297735Keywords:
P-Graph, Accelerated Branch and Bound, sctructural constraintAbstract
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.
Downloads
Download data is not yet available.
Downloads
Published
2024-03-04
How to Cite
Heinc, E., & Bánhelyi, B. (2024). Comparing Structural Constraints for Accelerated Branch and Bound Solver of Process Network Synthesis Problems. Acta Cybernetica, 26(3), 475–499. https://doi.org/10.14232/actacyb.297735
Issue
Section
Special Issue of the 13th Conference of PhD Students in Computer Science