The content focuses on designing edge-weighted networks to maximize algebraic connectivity, crucial for applications like cooperative vehicle localization. It introduces formulations as MISDP and MILP, upper-bounding algorithms, and a degree-constrained lower bounding formulation. A maximum cost heuristic is proposed for efficient solutions. Computational results show the effectiveness of the algorithms in optimizing network design.
In un'altra lingua
dal contenuto originale
arxiv.org
Approfondimenti chiave tratti da
by Neelkamal So... alle arxiv.org 03-20-2024
https://arxiv.org/pdf/2304.08571.pdfDomande più approfondite