Planning wireless networks by shortest path

DOI10.1007/S10589-009-9264-3zbMATH Open1219.90109OpenAlexW2158193851MaRDI QIDQ538307FDOQ538307

Authors: Carlo Mannino, Sara Mattia, Antonio Sassano 

Publication date: 25 May 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: http://eprints.bice.rm.cnr.it/1440/1/TR_2_09.pdf

Recommendations

• The Network Packing Problem in Terrestrial Broadcasting
• scientific article; zbMATH DE number 2042678
• Algorithm Theory - SWAT 2004
• Power assignment in radio networks with two power levels
• Optimization models and methods for planning wireless mesh networks

zbMATH Keywords

mixed integer programsexponential neighborhood searchwireless network optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Cites Work

• Network flows. Theory, algorithms, and applications.
• A survey of very large-scale neighborhood search techniques
• Solving systems of difference constraints incrementally
• Models and algorithms for terrestrial digital broadcasting
• UMTS radio network evaluation and optimization beyond snapshots
• The Network Packing Problem in Terrestrial Broadcasting
• Optimization problems and models for planning cellular networks

Cited In (4)

• A compact formulation for the base station deployment problem in wireless networks
• Speeding up column generation for robust wireless network planning
• A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
• Negative cycle separation in wireless network design

Uses Software

• CPLEX

This page was built for publication: Planning wireless networks by shortest path

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q538307)