activity
20182026
most citedA simple iterative algorithm for maxcut

10 citations · 18 across the 5 of their papers we have counts for

collaborators

6 papers

cs.LG2026

Congruence Decomposition with Neural Block Solvers for Large-Scale PCI Assignment

Yeqing Qiu, Chengpiao Huang, Ye Xue +7

Physical Cell Identity (PCI) assignment is essential for interference management in dense 5G networks. As cellular networks scale, PCI reuse becomes unavoidable, which may cause co…

eess.SP2025

Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks

Yeqing Qiu, Chengpiao Huang, Ye Xue +4

Physical Cell Identity (PCI) is a critical parameter in 5G networks. Efficient and accurate PCI assignment is essential for mitigating mod-3 interference, mod-30 interference, coll…

math.OC2023

A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming

Qingyu Han, Linxin Yang, Qian Chen +5

Mixed-integer linear programming (MILP) is widely employed for modeling combinatorial optimization problems. In practice, similar MILP instances with only coefficient variations ar…

cs.LG2022★ 7 cited

The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights

Maxime Gasse, Quentin Cappart, Jonas Charfreitag +38

Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolatio…

math.OC2022★ 1 cited

Efficient primal heuristics for mixed-integer linear programs

Akang Wang, Linxin Yang, Sha Lai +7

This paper is a short report about our work for the primal task in the Machine Learning for Combinatorial Optimization NeurIPS 2021 Competition. For each dataset of our interest in…

math.OC2018★ 10 cited

A simple iterative algorithm for maxcut

Sihong Shao, Dong Zhang, Weixi Zhang

We propose a simple iterative (SI) algorithm for the maxcut problem through fully using an equivalent continuous formulation. It does not need rounding at all and has advantages th…