Alapfogalmak
Designing robust networks by maximizing algebraic connectivity is essential for various applications.
Kivonat
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.
Structure:
- Introduction to Robust Network Design
- Mathematical Formulations for Optimization
- Upper Bounding Algorithms
- Degree-Constrained Lower Bounding Formulation
- Maximum Cost Heuristic
- Computational Results
Statisztikák
The problem is known to be NP-hard.
Extensive computational results support proposed methods.
Idézetek
"We introduce a novel upper-bounding algorithm based on principal minor characterization."
"Our approach formulates this problem as a Mixed Integer Semi-Definite Program (MISDP)."
"In addition, we propose a maximum cost heuristic with low computational complexity."