The following pages link to Christoph Helmberg (Q332627):
Displaying 43 items.
- Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy (Q332628) (← links)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian (Q662288) (← links)
- A note on Fiedler vectors interpreted as graph realizations (Q991473) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- (Q1396208) (redirect page) (← links)
- A spectral bundle method with bounds (Q1396209) (← links)
- Numerical evaluation of SBmethod (Q1411646) (← links)
- A semidefinite programming approach to the quadratic knapsack problem (Q1583699) (← links)
- Semidefinite programming (Q1600854) (← links)
- Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem (Q1742597) (← links)
- Cutting aluminium coils with high length variabilities (Q1897383) (← links)
- Optimization and stabilization of hierarchical electrical networks (Q1979700) (← links)
- Threshold graphs of maximal Laplacian energy (Q2339422) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- The symmetric quadratic traveling salesman problem (Q2434982) (← links)
- Dynamic graph generation for the shortest path problem in time expanded networks (Q2436645) (← links)
- On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations (Q2848176) (← links)
- (Q2917286) (← links)
- Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation (Q2917354) (← links)
- The spectral bundle method with second-order information (Q2926057) (← links)
- Robust rendering of general ellipses and elliptical arcs (Q3141198) (← links)
- The rotational dimension of a graph (Q3168659) (← links)
- A Parallel Bundle Framework for Asynchronous Subspace Optimization of Nonsmooth Convex Functions (Q3192104) (← links)
- On the Graph Bisection Cut Polytope (Q3394988) (← links)
- (Q3416563) (← links)
- The rotational Dimension of a graph (Q3439518) (← links)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
- Embedded in the Shadow of the Separator (Q3608992) (← links)
- (Q3840376) (← links)
- (Q4234142) (← links)
- (Q4263716) (← links)
- (Q4400647) (← links)
- A Spectral Bundle Method for Semidefinite Programming (Q4509732) (← links)
- (Q4517106) (← links)
- Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922) (← links)
- A spectral approach to bandwidth and separator problems in graphs (Q4853927) (← links)
- An Interior-Point Method for Semidefinite Programming (Q4884041) (← links)
- Fixing Variables in Semidefinite Relaxations (Q4943670) (← links)
- Periodic Event Scheduling for Automated Production Systems (Q5086025) (← links)
- Combining semidefinite and polyhedral relaxations for integer programs (Q5101410) (← links)
- Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs (Q5268000) (← links)
- (Q5465120) (← links)
- A preconditioned iterative interior point approach to the conic bundle subproblem (Q6126660) (← links)
