Abstract
Chapter 6 discussed the accelerated branch-and-bound algorithm that was created to exploit the combinatorial and structural properties of the P-graph framework for accelerating the solution search. This chapter contains the formal proof of algorithm ABB.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
Friedler F, Varga JB, Fehér E, Fan LT (1996) Combinatorially accerelated branch-and -bound method for solving the MIP model of process network synthesis. In: State of the art in global optimization. Springer, Boston, pp 609–626
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Friedler, F., Orosz, Á., Pimentel Losada, J. (2022). Formal Proof of Algorithm ABB. In: P-graphs for Process Systems Engineering. Springer, Cham. https://doi.org/10.1007/978-3-030-92216-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-92216-0_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92215-3
Online ISBN: 978-3-030-92216-0
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)