Pure 0-1 programming approaches to wireless network design. (Summary)

DOI10.1007/s10288-011-0162-zzbMath1362.90291OpenAlexW2170999162MaRDI QIDQ1936661

Fabio D'Andreagiovanni

Publication date: 6 February 2013

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-011-0162-z

zbMATH Keywords

service coveragewireless transmitters

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Boolean programming (90C09)

Related Items (7)

Accurate optimization models for interference constrained bandwidth allocation in cellular networks ⋮ A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks ⋮ Convex hull characterizations of lexicographic orderings ⋮ Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization ⋮ A compact formulation for the base station deployment problem in wireless networks ⋮ A New Theoretical Framework for Robust Optimization Under Multi-Band Uncertainty ⋮ Towards an Accurate Solution of Wireless Network Design Problems

This page was built for publication: Pure 0-1 programming approaches to wireless network design. (Summary)