Last change: 02.02.2024 10:23.
by M. Armbruster; Ch. Helmberg; M. Fügenschuh and A. Martin
Reference:
M. Armbruster; Ch. Helmberg; M. Fügenschuh and A. Martin: "A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem", In: Integer Programming and Combinatorial Optimization (A. Lodi; A. Panconesi; G. Renaldi, eds.), pp. 112 – 124, 2008.
Bibtex Entry:
@InProceedings{ArmbrusterHelmbergFuegenschuhMartin2008,
author = {M.~Armbruster and Ch.~Helmberg and M.~F\"ugenschuh and A.~Martin},
title = {A Comparative Study of Linear and Semidefinite Branch-and-Cut
Methods for Solving the Minimum Graph Bisection Problem},
series = {Proceedings of the IPCO 2008 Conference, LNCS 5035},
booktitle = {Integer Programming and Combinatorial Optimization},
editor = {A.~Lodi and A.~Panconesi and G.~Renaldi},
year = {2008},
pages = "112 -- 124",
} 
