World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

THE APPLICATION OF SEMIDEFINITE INTEGER PROGRAMMING MODEL FOR THE SIMULATION OF COMPLEX NETWORKS

    https://doi.org/10.1142/S0219525915500150Cited by:0 (Source: Crossref)

    Semidefinite integer programming model is an accurate tool for the structural design of networks. In this paper, we propose a semidefinite integer programming model with the constraints of spectral distributions and node degree distributions for the simulation of complex networks. Also, the feasible solutions and branch-and-bound solving algorithms of the model are designed. Based on eight metrics (e.g., spectral distribution, node degree distribution, clustering coefficients, etc.), the validity and practicability of the proposed method are illustrated.