Towards an accurate solution of wireless network design problems
From MaRDI portal
Abstract: The optimal design of wireless networks has been widely studied in the literature and many optimization models have been proposed over the years. However, most models directly include the signal-to-interference ratios representing service coverage conditions. This leads to mixed-integer linear programs with constraint matrices containing tiny coefficients that vary widely in their order of magnitude. These formulations are known to be challenging even for state-of-the-art solvers: the standard numerical precision supported by these solvers is usually not sufficient to reliably guarantee feasible solutions. Service coverage errors are thus commonly present. Though these numerical issues are known and become evident even for small-sized instances, just a very limited number of papers has tried to tackle them, by mainly investigating alternative non-compact formulations in which the sources of numerical instabilities are eliminated. In this work, we explore a new approach by investigating how recent advances in exact solution algorithms for linear and mixed-integer programs over the rational numbers can be applied to analyze and tackle the numerical difficulties arising in wireless network design models.
Recommendations
- Wireless network design. Optimization models and solution procedures.
- Solving nonlinear covering problems arising in WLAN design
- Negative cycle separation in wireless network design
- A chance-constrained model and cutting planes for fixed broadband wireless networks
- scientific article; zbMATH DE number 5173825
Cites work
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- An exact rational mixed-integer programming solver
- scientific article; zbMATH DE number 5823062 (Why is no real title available?)
- scientific article; zbMATH DE number 2079347 (Why is no real title available?)
- Improving the accuracy of linear programming solvers with iterative refinement
- Iterative refinement for linear programming
- Negative cycle separation in wireless network design
- Optimization problems and models for planning cellular networks
- Pure 0-1 programming approaches to wireless network design. (Summary)
- Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization
- Safe bounds in linear and mixed-integer linear programming
- SCIP: solving constraint integer programs
- The final NETLIB-LP results
- The Network Packing Problem in Terrestrial Broadcasting
- Wireless network design. Optimization models and solution procedures.
Cited in
(13)- Accurate optimization models for interference constrained bandwidth allocation in cellular networks
- Local solutions for global problems in wireless networks
- Optimizing compatible sets in wireless networks through integer programming
- Review of methodology and design of broadband wireless networks with linear topology
- A chance-constrained model and cutting planes for fixed broadband wireless networks
- Negative cycle separation in wireless network design
- scientific article; zbMATH DE number 1756641 (Why is no real title available?)
- Analysis and Design of Wireless Ad Hoc Networks With Channel Estimation Errors
- Wireless network design. Optimization models and solution procedures.
- A compact formulation for the base station deployment problem in wireless networks
- Speeding up the solution of the site and power assignment problem in wireless networks
- Quantum computing inspired iterative refinement for semidefinite optimization
- Wireless network design via 3-decompositions
This page was built for publication: Towards an accurate solution of wireless network design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835670)
