Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Helmberg, Christoph - Fakultät für Mathematik, Technische Universität Chemnitz
An Interior-Point Method for Semidefinite Programming
Technische Universitat Chemnitz Fakultat fur Mathematik
LP and SDP Branch-and-Cut Algorithms for the Minimum
An Interior Point Method for Semidefinite Programming and
Graph Realizations Associated with Minimizing the Maximum Eigenvalue of the Laplacian
On Minimizing the Spectral Width of Graph Laplacians and Associated
A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses
Embedded in the Shadow of the Separator
Combining Semidefinite and Polyhedral Relaxations
Incorporating Inequality Constraints in the Spectral Bundle Method
The Rotational Dimension of a Graph F. Gring C. Helmberg M. Wappler
A spectral approach to bandwidth and separator problems in graphs
A note on Fiedler vectors interpreted as graph realizations
On the Graph Bisection Cut polytope M. Armbruster, M. Fgenschuh, C. Helmberg,
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the
Dynamic Graph Generation for Large Scale Operational Train Timetabling
A Parallel Bundle Method for Asynchronous Subspace Optimization in Lagrangian Relaxation
