default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Helmberg
Person information
- affiliation: Chemnitz University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Christoph Helmberg
:
A preconditioned iterative interior point approach to the conic bundle subproblem. Math. Program. 205(1): 559-615 (2024)- 2022
- [j26]Christoph Helmberg, Tobias Hofmann, David Wenzel:
Periodic Event Scheduling for Automated Production Systems. INFORMS J. Comput. 34(2): 1291-1304 (2022) - 2021
- [i2]Christoph Helmberg:
A Preconditioned Iterative Interior Point Approach to the Conic Bundle Subproblem. CoRR abs/2110.11496 (2021)
2010 – 2019
- 2017
- [j25]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): 1196-1216 (2017) - 2015
- [j24]Christoph Helmberg, Vilmar Trevisan:
Threshold graphs of maximal Laplacian energy. Discret. Math. 338(7): 1075-1084 (2015) - 2014
- [j23]Frank Fischer, Christoph Helmberg:
Dynamic graph generation for the shortest path problem in time expanded networks. Math. Program. 143(1-2): 257-297 (2014) - [j22]Christoph Helmberg, Michael L. Overton, Franz Rendl:
The spectral bundle method with second-order information. Optim. Methods Softw. 29(4): 855-876 (2014) - [j21]Frank Fischer, Christoph Helmberg:
A Parallel Bundle Framework for Asynchronous Subspace Optimization of Nonsmooth Convex Functions. SIAM J. Optim. 24(2): 795-822 (2014) - 2013
- [j20]Anja Fischer, Christoph Helmberg:
The symmetric quadratic traveling salesman problem. Math. Program. 142(1-2): 205-254 (2013) - [j19]Frank Göring, Christoph Helmberg, Susanna Reiss:
On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations. SIAM J. Optim. 23(2): 834-856 (2013) - 2012
- [j18]Frank Göring, Christoph Helmberg, Susanna Reiss:
Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian. Math. Program. 131(1-2): 95-111 (2012) - [j17]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): 275-306 (2012) - 2011
- [j16]Frank Göring, Christoph Helmberg, Markus Wappler:
The rotational dimension of a graph. J. Graph Theory 66(4): 283-302 (2011) - 2010
- [j15]Christoph Helmberg, Susanna Reiss:
A note on Fiedler vectors interpreted as graph realizations. Oper. Res. Lett. 38(4): 320-321 (2010) - [c12]Frank Fischer, Christoph Helmberg:
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling. ATMOS 2010: 45-60
2000 – 2009
- 2009
- [i1]Christoph Helmberg:
Network Models with Convex Cost Structure like Bundle Methods. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j14]Michael Armbruster, Christoph Helmberg, Marzena Fügenschuh, Alexander Martin:
On the Graph Bisection Cut Polytope. SIAM J. Discret. Math. 22(3): 1073-1098 (2008) - [j13]Frank Göring, Christoph Helmberg, Markus Wappler:
Embedded in the Shadow of the Separator. SIAM J. Optim. 19(1): 472-501 (2008) - [c11]Frank Fischer, Christoph Helmberg, Jürgen Janßen, Boris Krostitz:
Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation. ATMOS 2008 - [c10]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: 112-124 - 2007
- [j12]Christoph Helmberg, Stefan Röhl:
A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses. Oper. Res. 55(4): 733-752 (2007) - 2006
- [j11]Frank Göring, Christoph Helmberg, Markus Wappler:
The rotational Dimension of a graph. Electron. Notes Discret. Math. 27: 37-38 (2006) - [c9]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: 1-12 - 2005
- [c8]Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin:
LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. OR 2005: 315-320 - 2004
- [p1]Christoph Helmberg:
A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations. The Sharpest Cut 2004: 233-256 - 2003
- [j10]Christoph Helmberg:
Numerical evaluation of SBmethod. Math. Program. 95(2): 381-406 (2003) - 2002
- [j9]Christoph Helmberg:
Semidefinite programming. Eur. J. Oper. Res. 137(3): 461-482 (2002) - [j8]Christoph Helmberg, Krzysztof C. Kiwiel:
A spectral bundle method with bounds. Math. Program. 93(2): 173-194 (2002) - 2000
- [j7]Christoph Helmberg, Franz Rendl, Robert Weismantel:
A Semidefinite Programming Approach to the Quadratic Knapsack Problem. J. Comb. Optim. 4(2): 197-215 (2000) - [j6]Christoph Helmberg, Franz Rendl:
A Spectral Bundle Method for Semidefinite Programming. SIAM J. Optim. 10(3): 673-696 (2000) - [j5]Christoph Helmberg:
Fixing Variables in Semidefinite Relaxations. SIAM J. Matrix Anal. Appl. 21(3): 952-969 (2000)
1990 – 1999
- 1999
- [c7]Christoph Helmberg:
The m-Cost ATSP. IPCO 1999: 242-258 - 1998
- [c6]Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl:
Incorporating Inequality Constraints in the Spectral Bundle Method. IPCO 1998: 423-436 - 1997
- [c5]Christoph Helmberg:
Fixing Variables in Semidefinite Relaxations. ESA 1997: 259-270 - 1996
- [j4]Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz:
An Interior-Point Method for Semidefinite Programming. SIAM J. Optim. 6(2): 342-361 (1996) - [c4]Christoph Helmberg, Franz Rendl, Robert Weismantel:
Quadratic Knapsack Relaxations Using Cutting Planes. IPCO 1996: 175-189 - 1995
- [j3]Christoph Helmberg:
Cutting aluminium coils with high length variabilities. Ann. Oper. Res. 57(1): 175-189 (1995) - [c3]Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz:
Combining Semidefinite and Polyhedral Relaxations for Integer Programs. IPCO 1995: 124-134 - 1994
- [j2]Dieter W. Fellner, Christoph Helmberg:
Best approximate general ellipses on integer grids. Comput. Graph. 18(2): 143-151 (1994) - 1993
- [j1]Dieter W. Fellner, Christoph Helmberg:
Robust Rendering of General Ellipses and Elliptical Arcs. ACM Trans. Graph. 12(3): 251-276 (1993) - [c2]Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl:
A spectral approach to bandwidth and separator problems in graphs. IPCO 1993: 183-194 - 1991
- [c1]Dieter W. Fellner, Christoph Helmberg:
Fast Rendering of General Ellipses. Eurographics 1991: 371-384
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
