Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems

Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems

Show other versions (1)

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...

Full description

Bibliographic Details
Main Author: Armbruster, Michael
Other Authors: Helmberg, Christoph
Format: Doctoral Thesis
Language:English
Published: 2007
Subjects:
info:eu-repo/classification/ddc/510
ddc:510
Bisektionsproblem
Branch-and-Cut-Methode
Semidefinite Optimierung
Cluster Weight Polytop
Kombinatorische Optimierung
Online Access:http://nbn-resolving.de/urn:nbn:de:swb:ch1-200701057
https://monarch.qucosa.de/id/qucosa%3A18747
https://monarch.qucosa.de/api/qucosa%3A18747/attachment/ATT-0/
https://monarch.qucosa.de/api/qucosa%3A18747/attachment/ATT-1/

Internet

http://nbn-resolving.de/urn:nbn:de:swb:ch1-200701057
https://monarch.qucosa.de/id/qucosa%3A18747
https://monarch.qucosa.de/api/qucosa%3A18747/attachment/ATT-0/
https://monarch.qucosa.de/api/qucosa%3A18747/attachment/ATT-1/

Similar Items