A look ahead branch and bound procedure for solving PNS problems (Q2755022)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A look ahead branch and bound procedure for solving PNS problems |
scientific article; zbMATH DE number 1668900
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A look ahead branch and bound procedure for solving PNS problems |
scientific article; zbMATH DE number 1668900 |
Statements
5 November 2001
0 references
process network synthesis
0 references
A look ahead branch and bound procedure for solving PNS problems (English)
0 references
In the present work a new branch and bound procedure is developed which is based on the merging reduction of Process Network Synthesis (PNS) problems and on a new branching rule. The power of the given procedure is justified by an empirical analysis showing and comparing running time and number of itaration steps.
0 references
