activity
20212024
most citedBranch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends

16 citations · 21 across the 14 of their papers we have counts for

collaborators

14 papers

eess.SY2024

Communication-efficient and Differentially-private Distributed Nash Equilibrium Seeking with Linear Convergence

Xiaomeng Chen, Wei Huo, Kemi Ding +2

The distributed computation of a Nash equilibrium (NE) for non-cooperative games is gaining increased attention recently. Due to the nature of distributed systems, privacy and comm…

eess.SY2024

Compression-based Privacy Preservation for Distributed Nash Equilibrium Seeking in Aggregative Games

Wei Huo, Xiaomeng Chen, Kemi Ding +2

This paper explores distributed aggregative games in multi-agent systems. Current methods for finding distributed Nash equilibrium require players to send original messages to thei…

eess.SP2024

Distributed Average Consensus via Noisy and Non-Coherent Over-the-Air Aggregation

Huiwen Yang, Xiaomeng Chen, Lingying Huang +2

Over-the-air aggregation has attracted widespread attention for its potential advantages in task-oriented applications, such as distributed sensing, learning, and consensus. In thi…

eess.SY2024

Differentially Private Dual Gradient Tracking for Distributed Resource Allocation

Wei Huo, Xiaomeng Chen, Lingying Huang +2

This paper investigates privacy issues in distributed resource allocation over directed networks, where each agent holds a private cost function and optimizes its decision subject…

eess.SY2023★ 1 cited

An Efficient Distributed Nash Equilibrium Seeking with Compressed and Event-triggered Communication

Xiaomeng Chen, Wei Huo, Yuchi Wu +2

Distributed Nash equilibrium (NE) seeking problems for networked games have been widely investigated in recent years. Despite the increasing attention, communication expenditure is…

cs.LG2023

Over-the-air Federated Policy Gradient

Huiwen Yang, Lingying Huang, Subhrakanti Dey +1

In recent years, over-the-air aggregation has been widely considered in large-scale distributed learning, optimization, and sensing. In this paper, we propose the over-the-air fede…

eess.SY2023

Sensor Selection for Remote State Estimation with QoS Requirement Constraints

Huiwen Yang, Lingying Huang, Chao Yang +2

In this paper, we study the sensor selection problem for remote state estimation under the Quality-of-Service (QoS) requirement constraints. Multiple sensors are employed to observ…

math.OC2023

A Privacy-Preserving Finite-Time Push-Sum based Gradient Method for Distributed Optimization over Digraphs

Xiaomeng Chen, Wei Jiang, Themistoklis Charalambous +1

This paper addresses the problem of distributed optimization, where a network of agents represented as a directed graph (digraph) aims to collaboratively minimize the sum of their…

eess.SY2023

Distributed Nash Equilibrium Seeking with Stochastic Event-Triggered Mechanism

Wei Huo, Kam Fai Elvis Tsang, Yamin Yan +2

In this paper, we study the problem of consensus-based distributed Nash equilibrium (NE) seeking where a network of players, abstracted as a directed graph, aim to minimize their o…

eess.SY2023

LQG Control Over SWIPT-enabled Wireless Communication Network

Huiwen Yang, Lingying Huang, Yuzhe Li +2

In this paper, we consider using simultaneous wireless information and power transfer (SWIPT) to recharge the sensor in the LQG control, which provides a new approach to prolonging…

cs.MA2022★ 3 cited

Linear Convergent Distributed Nash Equilibrium Seeking with Compression

Xiaomeng Chen, Yuchi Wu, Xinlei Yi +2

Information compression techniques are majorly employed to address the concern of reducing communication cost over peer-to-peer links. In this paper, we investigate distributed Nas…

math.OC2022★ 1 cited

Improving Primal Heuristics for Mixed Integer Programming Problems based on Problem Reduction: A Learning-based Approach

Lingying Huang, Xiaomeng Chen, Wei Huo +4

In this paper, we propose a Bi-layer Predictionbased Reduction Branch (BP-RB) framework to speed up the process of finding a high-quality feasible solution for Mixed Integer Progra…

cs.LG2021★ 16 cited

Branch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends

Lingying Huang, Xiaomeng Chen, Wei Huo +4

In this paper, we surveyed the existing literature studying different approaches and algorithms for the four critical components in the general branch and bound (B&B) algorithm, na…

math.OC2021

Simplex Initialization: A Survey of Techniques and Trends

Mengyu Huang, Yuxing Zhong, Huiwen Yang +4

The simplex method is one of the most fundamental technologies for solving linear programming (LP) problems and has been widely applied to different practical applications. In the…