Column Generation for Optimization Problems in Communication Networks

Ziye Jia; Qihui Wu; Chao Dong; Chau Yuen; Zhu Han

Home/Archive/arXiv

arXiv · 2211.05547

Column Generation for Optimization Problems in Communication Networks

Ziye Jia·Qihui Wu·Chao Dong·Chau Yuen·Zhu Han

View original source ↗Read source document ↗Export metadata ↓

Abstract

Numerous communication networks are emerging to serve the various demands and improve the quality of service. Heterogeneous users have different requirements on quality metrics such as delay and service efficiency. Besides, the networks are equipped with different types and amounts of resources, and how to efficiently optimize the usage of such limited resources to serve more users is the key issue for communication networks. One powerful mathematical optimization mechanism to solve the above issue is column generation (CG), which can deal with the optimization problems with complicating constraints and block angular structures. In this paper, we first review the preliminaries of CG. Further, the branch-and-price (BP) algorithm is elaborated, which is designed by embedding CG into the branch-and-bound scheme to efficiently obtain the optimal solution. The applications of CG and BP in various communication networks are then provided, such as space-air-ground networks and device-to-device networks. In short, our goal is to help readers refine the applications of the CG optimization tool in terms of problem formulation and solution. We also discuss the possible challenges and prospective directions when applying CG in the communication networks.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Ziye Jia, Qihui Wu, Chao Dong, Chau Yuen, Zhu Han. 2022-11-10. Column Generation for Optimization Problems in Communication Networks. https://arxiv.org/abs/2211.05547

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗