Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm

DOI10.1007/s10878-023-01051-4zbMath1530.90058MaRDI QIDQ6173938

Wenguo Yang, Sui-Xiang Gao, Zhipeng Jiang, Zhengxi Yang

Publication date: 13 July 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

iteration algorithmgraph partitioning0-1 mixed linear programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Mixed integer programming (90C11) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Finding good approximate vertex and edge partitions is NP-hard
• Graph partitioning using linear and semidefinite programming
• Linear and quadratic programming approaches for the general graph partitioning problem
• Metaheuristics for the minimum gap graph partitioning problem
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• VLSI Physical Design: From Graph Partitioning to Timing Closure
• An Efficient Heuristic Procedure for Partitioning Graphs
• On the Quality of Partitions Based on Space-Filling Curves
• On the Two-Stage Stochastic Graph Partitioning Problem
• Branch-and-Bound Methods: A Survey
• Some graph optimization problems with weights satisfying linear constraints
• ILP-Based Local Search for Graph Partitioning

This page was built for publication: Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm