๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Offdiagonal complexity: A computationally quick complexity measure for graphs and networks

โœ Scribed by Jens Christian Claussen

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
683 KB
Volume
375
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hypertargets: a Conceptual Programming a
Hypertargets: a Conceptual Programming approach for the optimisation of industrial heat exchanger networksโ€”I. Grassroots design and network complexity
โœ V. Briones; A.C. Kokossis ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 537 KB

The paper proposes a new design approach for the optimal synthesis of heat exchanger networks. The approach combines thermodynamics, engineering knowledge, and mathematical programming and leads to Conceptual Programming methodology with a clear potential to address industrial applications from a sy

New complexity measures for the facility
New complexity measures for the facility layout problem: an empirical study using traditional and neural network analysis
โœ Donald F Rossin; Mark C Springer; Barbara D Klein ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 263 KB

The most frequent application of the quadratic assignment problem has been in facility layout, which is concerned with locating the activities or departments of an organization in a ยฎxed set of locations such that those activities with the strongest interrelationships are closest to each other. Earl