Christoph Helmberg

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 4

Top Topics

Integer Program

Convex Functions

Top Venues

SIAM J. Discret. Math.

Publications

Christoph Helmberg
A preconditioned iterative interior point approach to the conic bundle subproblem. Math. Program. 205 (1) (2024)
Christoph Helmberg, Tobias Hofmann, David Wenzel
Periodic Event Scheduling for Automated Production Systems. INFORMS J. Comput. 34 (2) (2022)
Christoph Helmberg
A Preconditioned Iterative Interior Point Approach to the Conic Bundle Subproblem. CoRR (2021)
Christoph Helmberg, Israel Rocha, Uwe Schwerdtfeger
Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Christoph Helmberg, Vilmar Trevisan
Threshold graphs of maximal Laplacian energy. Discret. Math. 338 (7) (2015)
Christoph Helmberg, Michael L. Overton, Franz Rendl
The spectral bundle method with second-order information. Optim. Methods Softw. 29 (4) (2014)
Frank Fischer, Christoph Helmberg
A Parallel Bundle Framework for Asynchronous Subspace Optimization of Nonsmooth Convex Functions. SIAM J. Optim. 24 (2) (2014)
Frank Fischer, Christoph Helmberg
Dynamic graph generation for the shortest path problem in time expanded networks. Math. Program. 143 (1-2) (2014)
Anja Fischer, Christoph Helmberg
The symmetric quadratic traveling salesman problem. Math. Program. 142 (1-2) (2013)
Frank Göring, Christoph Helmberg, Susanna Reiss
On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations. SIAM J. Optim. 23 (2) (2013)
Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison. Math. Program. Comput. 4 (3) (2012)
Frank Göring, Christoph Helmberg, Susanna Reiss
Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian. Math. Program. 131 (1-2) (2012)
Frank Göring, Christoph Helmberg, Markus Wappler
The rotational dimension of a graph. J. Graph Theory 66 (4) (2011)
Frank Fischer, Christoph Helmberg
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling. ATMOS (2010)
Christoph Helmberg, Susanna Reiss
A note on Fiedler vectors interpreted as graph realizations. Oper. Res. Lett. 38 (4) (2010)
Christoph Helmberg
Network Models with Convex Cost Structure like Bundle Methods. Models and Algorithms for Optimization in Logistics (2009)
Michael Armbruster, Christoph Helmberg, Marzena Fügenschuh, Alexander Martin
On the Graph Bisection Cut Polytope. SIAM J. Discret. Math. 22 (3) (2008)
Frank Göring, Christoph Helmberg, Markus Wappler
Embedded in the Shadow of the Separator. SIAM J. Optim. 19 (1) (2008)
Frank Fischer, Christoph Helmberg, Jürgen Janßen, Boris Krostitz
Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation. ATMOS (2008)
Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. IPCO (2008)
Christoph Helmberg, Stefan Röhl
A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses. Oper. Res. 55 (4) (2007)
Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin
Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem. EvoCOP (2006)
Frank Göring, Christoph Helmberg, Markus Wappler
The rotational Dimension of a graph. Electron. Notes Discret. Math. 27 (2006)
Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin
LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. OR (2005)
Christoph Helmberg
Numerical evaluation of SBmethod. Math. Program. 95 (2) (2003)
Christoph Helmberg, Krzysztof C. Kiwiel
A spectral bundle method with bounds. Math. Program. 93 (2) (2002)
Christoph Helmberg
Semidefinite programming. Eur. J. Oper. Res. 137 (3) (2002)
Christoph Helmberg, Franz Rendl
A Spectral Bundle Method for Semidefinite Programming. SIAM J. Optim. 10 (3) (2000)
Christoph Helmberg
Fixing Variables in Semidefinite Relaxations. SIAM J. Matrix Anal. Appl. 21 (3) (2000)
Christoph Helmberg, Franz Rendl, Robert Weismantel
A Semidefinite Programming Approach to the Quadratic Knapsack Problem. J. Comb. Optim. 4 (2) (2000)
Christoph Helmberg
The m-Cost ATSP. IPCO (1999)
Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl
Incorporating Inequality Constraints in the Spectral Bundle Method. IPCO (1998)
Christoph Helmberg
Fixing Variables in Semidefinite Relaxations. ESA (1997)
Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz
An Interior-Point Method for Semidefinite Programming. SIAM J. Optim. 6 (2) (1996)
Christoph Helmberg, Franz Rendl, Robert Weismantel
Quadratic Knapsack Relaxations Using Cutting Planes. IPCO (1996)
Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz
Combining Semidefinite and Polyhedral Relaxations for Integer Programs. IPCO (1995)
Christoph Helmberg
Cutting aluminium coils with high length variabilities. Ann. Oper. Res. 57 (1) (1995)
Dieter W. Fellner, Christoph Helmberg
Best approximate general ellipses on integer grids. Comput. Graph. 18 (2) (1994)
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl
A spectral approach to bandwidth and separator problems in graphs. IPCO (1993)
Dieter W. Fellner, Christoph Helmberg
Robust Rendering of General Ellipses and Elliptical Arcs. ACM Trans. Graph. 12 (3) (1993)
Dieter W. Fellner, Christoph Helmberg
Fast Rendering of General Ellipses. Eurographics (1991)