Heuristics for synthesizing robust networks with a diameter constraint

DOI10.1155/2014/326963zbMath1407.90078OpenAlexW1976379299WikidataQ59064282 ScholiaQ59064282MaRDI QIDQ1718143

Dengfeng Sun, Harsha Nagarajan, Peng Wei, Sivakumar Rathinam

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/326963

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10)

Uses Software

• CPLEX
• Algorithm 97

Cites Work

• Unnamed Item
• Algorithms for synthesizing mechanical systems with maximal natural frequencies
• Maximum algebraic connectivity augmentation is NP-hard
• Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity
• A Method for Solving Traveling-Salesman Problems

This page was built for publication: Heuristics for synthesizing robust networks with a diameter constraint