Christoph Helmberg

According to our database, Christoph Helmberg authored at least 39 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A preconditioned iterative interior point approach to the conic bundle subproblem.

Christoph Helmberg

Math. Program., May, 2024

2022

Periodic Event Scheduling for Automated Production Systems.

Christoph Helmberg, Tobias Hofmann, David Wenzel

INFORMS J. Comput., 2022

2017

Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs.

Christoph Helmberg, Israel Rocha, Uwe Schwerdtfeger

SIAM J. Discret. Math., 2017

2015

Threshold graphs of maximal Laplacian energy.

Christoph Helmberg, Vilmar Trevisan

Discret. Math., 2015

2014

A Parallel Bundle Framework for Asynchronous Subspace Optimization of Nonsmooth Convex Functions.

Frank Fischer, Christoph Helmberg

SIAM J. Optim., 2014

The spectral bundle method with second-order information.

Christoph Helmberg, Michael L. Overton, Franz Rendl

Optim. Methods Softw., 2014

Dynamic graph generation for the shortest path problem in time expanded networks.

Frank Fischer, Christoph Helmberg

Math. Program., 2014

2013

On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations.

Frank Göring, Christoph Helmberg, Susanna Reiss

SIAM J. Optim., 2013

The symmetric quadratic traveling salesman problem.

Anja Fischer, Christoph Helmberg

Math. Program., 2013

2012

LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison.

Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin

Math. Program. Comput., 2012

Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian.

Frank Göring, Christoph Helmberg, Susanna Reiss

Math. Program., 2012

2010

A note on Fiedler vectors interpreted as graph realizations.

Christoph Helmberg, Susanna Reiss

Oper. Res. Lett., 2010

Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling.

Frank Fischer, Christoph Helmberg

Proceedings of the ATMOS 2010, 2010

2009

Network Models with Convex Cost Structure like Bundle Methods.

Christoph Helmberg

Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2008

Embedded in the Shadow of the Separator.

Frank Göring, Christoph Helmberg, Markus Wappler

SIAM J. Optim., 2008

On the Graph Bisection Cut Polytope.

Michael Armbruster, Christoph Helmberg, Marzena Fügenschuh, Alexander Martin

SIAM J. Discret. Math., 2008

A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem.

Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation.

Frank Fischer, Christoph Helmberg, Jürgen Janßen, Boris Krostitz

Proceedings of the ATMOS 2008, 2008

2007

A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses.

Christoph Helmberg, Stefan Röhl

Oper. Res., 2007

2006

The rotational Dimension of a graph.

Frank Göring, Christoph Helmberg, Markus Wappler

Electron. Notes Discret. Math., 2006

Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem.

Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

2005

LP-based Genetic Algorithm for the Minimum Graph Bisection Problem.

Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin

Proceedings of the Operations Research Proceedings 2005, 2005

2004

A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations.

Christoph Helmberg

Proceedings of the Sharpest Cut, 2004

2003

Numerical evaluation of SBmethod.

Christoph Helmberg

Math. Program., 2003

2002

A spectral bundle method with bounds.

Christoph Helmberg, Krzysztof C. Kiwiel

Math. Program., 2002

Semidefinite programming.

Christoph Helmberg

Eur. J. Oper. Res., 2002

2000

Fixing Variables in Semidefinite Relaxations.

Christoph Helmberg

SIAM J. Matrix Anal. Appl., 2000

A Spectral Bundle Method for Semidefinite Programming.

Christoph Helmberg, Franz Rendl

SIAM J. Optim., 2000

A Semidefinite Programming Approach to the Quadratic Knapsack Problem.

Christoph Helmberg, Franz Rendl, Robert Weismantel

J. Comb. Optim., 2000

1999

The m-Cost ATSP.

Christoph Helmberg

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

Incorporating Inequality Constraints in the Spectral Bundle Method.

Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1996

An Interior-Point Method for Semidefinite Programming.

Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz

SIAM J. Optim., 1996

Quadratic Knapsack Relaxations Using Cutting Planes.

Christoph Helmberg, Franz Rendl, Robert Weismantel

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

Cutting aluminium coils with high length variabilities.

Christoph Helmberg

Ann. Oper. Res., 1995

Combining Semidefinite and Polyhedral Relaxations for Integer Programs.

Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Best approximate general ellipses on integer grids.

Dieter W. Fellner, Christoph Helmberg

Comput. Graph., 1994

1993

Robust Rendering of General Ellipses and Elliptical Arcs.

Dieter W. Fellner, Christoph Helmberg

ACM Trans. Graph., 1993

A spectral approach to bandwidth and separator problems in graphs.

Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1991

Fast Rendering of General Ellipses.

Dieter W. Fellner, Christoph Helmberg

Proceedings of the 12th European Computer Graphics Conference and Exhibition, 1991