Optimizing compatible sets in wireless networks through integer programming

DOI10.1007/S13675-013-0015-YMaRDI QIDQ2513731zbMATH OpenOpenAlexFDO

Authors Michał Pióro, Di Yuan, Jinshu Su, Yuan Li

Publication date 28 January 2015

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/s13675-013-0015-y

zbMATH Keywords

branch-and-cutGomory-Hu treematching polytopeminimum odd-cut generationSINR

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Mixed integer programming (90C11)

Recommendations

• Wireless network design. Optimization models and solution procedures.
• Towards an accurate solution of wireless network design problems
• A near-optimal optimization algorithm for link assignment in wireless ad-hoc networks
• Optimization in wireless networks
• Wireless capacity with arbitrary gain matrix

Cites work

• A constant-factor approximation for wireless capacity maximization with power control in the SINR model
• A new approach to the maximum-flow problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial optimization. Theory and applications.
• Fundamentals of Wireless Communication
• scientific article; zbMATH DE number 1305427 (Why is no real title available?)
• Solving a resource allocation problem in wireless mesh networks: a comparison between a CP-based and a classical column generation
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Very Simple Methods for All Pairs Network Flow Analysis

Cited in

(1)

• Accurate optimization models for interference constrained bandwidth allocation in cellular networks

This page was built for publication: Optimizing compatible sets in wireless networks through integer programming

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