Planning wireless networks by shortest path

DOI10.1007/s10589-009-9264-3zbMath1219.90109OpenAlexW2158193851MaRDI QIDQ538307

Antonio Sassano, Sara Mattia, Carlo Mannino

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

zbMATH Keywords

mixed integer programsexponential neighborhood searchwireless network optimization

Mathematics Subject Classification ID

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

Related Items (1)

A compact formulation for the base station deployment problem in wireless networks

Uses Software

• CPLEX

Cites Work

• 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
• Unnamed Item
• Unnamed Item

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