A branch-and-cut algorithm for the equicut problem
Copyright policy )A branch-and-cut algorithm for the equicut problem
We describe an algorithm for solving the equicut problem on complete graphs. The core of the algorithm is a cutting-plane procedure that exploits a subset of the linear inequalities defining the convex hull of the incidence vectors of the edge sets that define an equicut. The cuts are generated by several separation procedures that will be described in the paper. Whenever the cutting-plane procedure does not terminate with an optimal solution, the algorithm uses a branch-and-cut strategy. We also describe the implementation of the algorithm and the interface with the LP solver. Finally, we report on computational results on dense instances with sizes up to 100 nodes..
complete graphs, equicut problem, cutting-plane procedure, Polyhedral theory, Programming involving graphs or networks, Equicut, Heuristic algorithm, Cutting-plane algorithm, branch-and-cut, Branch-and-cut; Cutting-plane algorithm; Equicut; Heuristic algorithm; Max-cut; Polyhedral theory; Computer Graphics and Computer-Aided Design; Software; Management Science and Operations Research; Safety, Risk, Reliability and Quality; Mathematics (all); Applied Mathematics, Branch-and-cut, heuristic algorithm, Max-cut
complete graphs, equicut problem, cutting-plane procedure, Polyhedral theory, Programming involving graphs or networks, Equicut, Heuristic algorithm, Cutting-plane algorithm, branch-and-cut, Branch-and-cut; Cutting-plane algorithm; Equicut; Heuristic algorithm; Max-cut; Polyhedral theory; Computer Graphics and Computer-Aided Design; Software; Management Science and Operations Research; Safety, Risk, Reliability and Quality; Mathematics (all); Applied Mathematics, Branch-and-cut, heuristic algorithm, Max-cut
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).31 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!