Hauptinhalt
Prof. Dr. Christoph Buchheim
Artikel in Zeitschriften
-
Speeding up IP-based Algorithms for Constrained Quadratic 0–1
Optimization
Mathematical Programming (Series B), to appear
(with F. Liers and M. Oswald)
-
Exact Algorithms for the Quadratic Linear Ordering Problem
INFORMS Journal on Computing, to appear
(with A. Wiegele and L. Zheng)
-
Terse Integer Linear Programs for Boolean Optimization
Journal on Satisfiability, Boolean Modeling and Computation 6, pp 121–139 (2009)
(with G. Rinaldi)
-
On the Subgroup Distance Problem
Discrete Mathematics 309, pp 962–968 (2009)
(with P. J. Cameron and T. Wu)
-
Local Cuts Revisited
Operations Research Letters 36, pp 430–433 (2008)
(with F. Liers and M. Oswald)
-
Testing Planarity of Geometric Automorphisms in Linear Time
Algorithmica 52, pp 448–465 (2008)
(with S. Hong)
-
A Branch-and-Cut Approach to the Crossing Number Problem
Discrete Optimization 5(2), pp 373–388 (2008)
(with M. Chimani, D. Ebner, C. Gutwenger, M. Jünger, G. W. Klau, P. Mutzel, and R. Weiskircher)
-
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
SIAM Journal on Optimization 18(4), pp 1398–1413 (2007)
(with G. Rinaldi)
-
Drawing Rooted Trees in Linear Time
Software: Practice & Experience 36(6), pp 651–665 (2006)
(with M. Jünger and S. Leipert)
-
Linear Optimization over Permutation Groups
Discrete Optimization 2(4), pp 308–319 (2005)
(with M. Jünger)
-
Crossing Minimization for Symmetries
Theory of Computing Systems 38(3), pp 293–311 (2005)
(with S. Hong)
-
On the Complexity of Drawing Trees Nicely: Corrigendum
Acta Informatica 40(8), pp 603–607 (2004)
(with T. Akkerman, M. Jünger, and D. Teske)
-
Réduction des tores déployés par une extension modérément ramifiée (Reduction of tori split over tamely ramified extensions)
Comptes rendus Mathématique 338(3), pp 219–221 (2004)
(with H. Frommer)
-
Detecting Symmetries by Branch & Cut
Mathematical Programming (Series B) 98, pp 369–384 (2003)
(with M. Jünger)
-
Letzte Änderung: 24.10.2009 10:52
|