Table 2 Nelder–Mead algorithm parameter results
From: Robust communication network formation: a decentralized approach
Graph Size | \(\gamma\) | w |
|---|---|---|
\(n=10\) | 0.642 | 1.096 |
\(n=15\) | 0.555 | 1.210 |
\(n=20\) | 1.288 | 0.863 |
From: Robust communication network formation: a decentralized approach
Graph Size | \(\gamma\) | w |
|---|---|---|
\(n=10\) | 0.642 | 1.096 |
\(n=15\) | 0.555 | 1.210 |
\(n=20\) | 1.288 | 0.863 |