IPCO   2008 International Conference on Integer Programming and Combinatorial Optimization
Wall of Fame | Most Viewed IPCO-2008 Paper
221views Optimization» more  IPCO 2008»
13 years 4 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source221
2Download preprint from source188
3Download preprint from source163
4Download preprint from source143
5Download preprint from source136
6Download preprint from source131
7Download preprint from source129
8Download preprint from source118
9Download preprint from source114
10Download preprint from source110
11Download preprint from source110
12Download preprint from source105
13Download preprint from source103
14Download preprint from source103
15Download preprint from source91
16Download preprint from source90
17Download preprint from source87
18Download preprint from source82
19Download preprint from source78