Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems
This thesis deals with the exact solution of large-scale minimum bisection problems via a semidefinite relaxation in a branch-and-cut framework. After reviewing known results on the underlying bisection cut polytope a study of new facet-defining inequalities is presented. They are derived from the k...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Universitätsbibliothek Chemnitz
2007
|
| Subjects: | |
| Online Access: | http://nbn-resolving.de/urn:nbn:de:swb:ch1-200701057 http://nbn-resolving.de/urn:nbn:de:swb:ch1-200701057 http://www.qucosa.de/fileadmin/data/qucosa/documents/5421/data/diss.pdf http://www.qucosa.de/fileadmin/data/qucosa/documents/5421/20070105.txt |