Mathematical programming models for some smallest-world problems

DOI10.1016/j.nonrwa.2005.02.001zbMath1086.90056MaRDI QIDQ2572112

H. W. Corley, Jay M. Rosenberger

Publication date: 14 November 2005

Published in: Nonlinear Analysis. Real World Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.nonrwa.2005.02.001

zbMATH Keywords

Binary programming; Minimum diameter graphs; Small world networks

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C80: Random graphs (graph-theoretic aspects)

90C09: Boolean programming

Related Items

A new class of interval projection neural networks for solving interval quadratic program

Cites Work

• Unnamed Item
• Unnamed Item
• On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
• Unravelling small world networks
• Deterministic small-world networks
• Augmenting trees to meet biconnectivity and diameter constraints
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The small-world phenomenon
• Diameter increase caused by edge deletion
• The Structure and Function of Complex Networks
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks