|
Search the dblp DataBase
Christoph Helmberg:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Christoph Helmberg
Fixing Variables in Semidefinite Relaxations. [Citation Graph (0, 0)][DBLP] ESA, 1997, pp:259-270 [Conf]
- Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin
Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem. [Citation Graph (0, 0)][DBLP] EvoCOP, 2006, pp:1-12 [Conf]
- Christoph Helmberg
The m-Cost ATSP. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:242-258 [Conf]
- Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl
Incorporating Inequality Constraints in the Spectral Bundle Method. [Citation Graph (0, 0)][DBLP] IPCO, 1998, pp:423-436 [Conf]
- Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl
A spectral approach to bandwidth and separator problems in graphs. [Citation Graph (0, 0)][DBLP] IPCO, 1993, pp:183-194 [Conf]
- Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz
Combining Semidefinite and Polyhedral Relaxations for Integer Programs. [Citation Graph (0, 0)][DBLP] IPCO, 1995, pp:124-134 [Conf]
- Christoph Helmberg, Franz Rendl, Robert Weismantel
Quadratic Knapsack Relaxations Using Cutting Planes. [Citation Graph (0, 0)][DBLP] IPCO, 1996, pp:175-189 [Conf]
- Dieter W. Fellner, Christoph Helmberg
Best approximate general ellipses on integer grids. [Citation Graph (0, 0)][DBLP] Computers & Graphics, 1994, v:18, n:2, pp:143-151 [Journal]
- Christoph Helmberg, Franz Rendl, Robert Weismantel
A Semidefinite Programming Approach to the Quadratic Knapsack Problem. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2000, v:4, n:2, pp:197-215 [Journal]
- Christoph Helmberg
Numerical evaluation of SBmethod. [Citation Graph (0, 0)][DBLP] Math. Program., 2003, v:95, n:2, pp:381-406 [Journal]
- Dieter W. Fellner, Christoph Helmberg
Robust Rendering of General Ellipses and Elliptical Arcs. [Citation Graph (0, 0)][DBLP] ACM Trans. Graph., 1993, v:12, n:3, pp:251-276 [Journal]
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. [Citation Graph (, )][DBLP]
Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation. [Citation Graph (, )][DBLP]
LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|