% Encoding: UTF-8
@COMMENT{BibTeX export based on data in FAU CRIS: https://cris.fau.de/}
@COMMENT{For any questions please write to cris-support@fau.de}
@incollection{faucris.123559524,
abstract = {A minimum equicut of an edge-weighted graph is a partition of the nodes of the graph into two sets of equal size such that the sum of the weights of edges joining nodes in different partitions is minimum. We compare basic linear and semidefinite relaxations for the equicut problem, and find that linear bounds are competitive with the corresponding semidefinite ones but can be computed much faster. Motivated by an application of equicut in theoretical physics, we revisit an approach by Brunetta et al. and present an enhanced branch-and-cut algorithm. Our computational results suggest that the proposed branch-and-cut algorithm has a better performance than the algorithm of Brunetta et al. Further, it is able to solve to optimality in reasonable time several instances with more than 200 nodes from the physics application.},
address = {Berlin Heidelberg},
author = {Anjos, Miguel and Liers, Frauke and Pardella, Gregor L. and Schmutzer, Andreas},
booktitle = {Discrete Geometry and Optimization},
doi = {10.1007/978-3-319-00200-2{\_}2},
editor = {Karoly Bezdek, Antoine Deza, Yinyu Ye},
faupublication = {yes},
isbn = {978-3-319-00199-9},
keywords = {Equicut, Maximum-Cut, Bisection, Graph partitioning, Linear programming, Semidefinite programming, Branch-and-cut},
pages = {17-32},
peerreviewed = {unknown},
publisher = {Springer},
series = {Fields Institute Communications},
title = {{Engineering} {Branch}-and-{Cut} {Algorithms} for the {Equicut} {Problem}},
volume = {69},
year = {2013}
}