Christoph Helmberg

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