A complementary column generation approach for the graph equipartition problem

DOI10.15388/20-INFOR391MaRDI QIDQ5155466zbMATH OpenFDO

Authors Salem M. al-Ykoob, Hanif D. Sherali

Publication date 6 October 2021

Published in Informatica (Vilnius) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15388/20-INFOR391

zbMATH Keywords

column generationcomplementary column generationgraph partitioningmixed integer programming

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
• The node capacitated graph partitioning problem: A computational study
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• A computational study of graph partitioning
• A class of bounded approximation algorithms for graph partitioning

Cites work

• A Genetic Algorithm for Railway Scheduling Problems
• Branch-and-price: Column generation for solving huge integer programs
• Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach
• Graph clustering
• scientific article; zbMATH DE number 5641435 (Why is no real title available?)
• scientific article; zbMATH DE number 1302175 (Why is no real title available?)
• Semidefinite programming relaxations for the graph partitioning problem

Cited in

(3)

• Column-generation based bounds for the homogeneous areas problem
• Determining optimal channel partition for 2:4 fine grained structured sparsity
• Optimizing connected components graph partitioning with minimum size constraints using integer programming and spectral clustering techniques

This page was built for publication: A complementary column generation approach for the graph equipartition problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155466)