Optimizing compatible sets in wireless networks through integer programming
Yuan Li,Michal Pioro,Michal Pioro,Di Yuan,Jinshu Su +4 more
- 01 Jun 2014
- Vol. 2, Iss: 1, pp 1-15
TL;DR: A comparison of the two basic approaches to expressing the signal-to-interference-plus-noise-ratio within integer programming is presented, and matching inequalities that improve the upper bounds achievable with the twobasic approaches are introduced.
read more
Abstract: In wireless networks, the notion of compatible set refers to a set of radio links that can be simultaneously active with a tolerable interference. Finding a compatible set with maximum weighted revenue from the parallel transmissions is an important optimization subproblem for resource management in wireless networks. For this subproblem, two basic ways of expressing the signal-to-interference-plus-noise-ratio within integer programming are used, differing in the number of variables and the quality of the upper bound given by their linear relaxations. To our knowledge, there is no systematic study comparing the effectiveness of these two approaches to the compatible set optimization problem. The contribution of the article is twofold. First, we present a comparison of the two basic approaches, and, second, we introduce matching inequalities that improve the upper bounds achievable with the two basic approaches. The matching inequalities are generated within the branch-and-cut process using a minimum odd-cut generation procedure based on the Gomory–Hu tree algorithm. The article presents results of a numerical study illustrating our statements and findings.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Building Agile and Resilient UAV Networks Based on SDN and Blockchain
TL;DR: In this article, the authors propose a new type of UAV network based on SDN architecture and blockchain technology, which is named SUV, which implements a logically centralized but physically distributed control plane, which can quickly build UAV networks according to the application requirements and communication environment, and is suitable for 5G-oriented UAV networking.
49
A minimized-rule based approach for improving data currency
Mohan Li,Jianzhong Li +1 more
TL;DR: A new class of currency repairing rules (CRR for short) is proposed to express both domain knowledge and statistical information and the experiments show that the proposed methods are efficient and effective.
9
A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network
Qing He
- 01 Jan 2016
TL;DR: This research presents a state-of-the-art solution that automates the very labor-intensive and therefore time-heavy and expensive and therefore expensive and expensive process of establishing and maintaining wireless networks.
On extremal Zagreb indices of trees with given domination number
Bojana Borovićanin,Boris Furtula +1 more
TL;DR: Upper bounds on Zagreb indices of trees in terms of domination number are presented, and strict bounds, and extremal trees are characterized, including a unique tree with given domination number that maximizes H.
References
Combinatorial optimization. Polyhedra and efficiency.
Alexander Schrijver
- 01 Jan 2003
TL;DR: This book shows the combinatorial optimization polyhedra and efficiency as your friend in spending the time in reading a book.
4.5K
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Jack Edmonds,Richard M. Karp +1 more
TL;DR: New algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem are presented, and Dinic shows that, in a network with n nodes and p arcs, a maximum flow can be computed in 0 (n2p) primitive operations by an algorithm which augments along shortest augmenting paths.
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.
Jack Edmonds,Richard M. Karp +1 more
- 01 Jan 2001
TL;DR: In this article, the authors presented new algorithms for the maximum flow problem, the Hitchcock transportation problem and the general minimum-cost flow problem and derived upper bounds on the number of steps in these algorithms.
2K
A new approach to the maximum-flow problem
TL;DR: An alternative method based on the preflow concept of Karzanov, which runs as fast as any other known method on dense graphs, achieving an O(n) time bound on an n-vertex graph and faster on graphs of moderate density.
SNDlib 1.0—Survivable Network Design Library
TL;DR: The data concepts of SNDlib are discussed and a mathematical model for each design problem considered in the library is described, which leads to 830 network design problem instances.