| Nr. |
Titel |
Autor |
Jahr |
| 1 |
Energy-sensitive process chain optimization on the example of forging |
Fischer, Anja et al. |
2013 |
| 2 |
A Parallel Bundle Method for Asynchronous Subspace Optimization in Lagrangian Relaxation |
Fischer, Frank et al. |
2012 |
| 3 |
BMBF Projekt ROBUKOM: Robust Communication Networks |
Koster, Arie M.C.A. et al. |
2012 |
| 4 |
Dynamic graph generation for the shortest path problem in time expanded networks |
Fischer, Frank et al. |
2012 |
| 5 |
Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian |
Göring, Frank et al. |
2012 |
| 6 |
The Spectral Bundle Method with Second-Order Information |
Helmberg, Christoph et al. |
2012 |
| 7 |
The symmetric quadratic traveling salesman problem |
Fischer, Anja et al. |
2012 |
| 8 |
Dynamic Graph Generation for Large Scale Operational Train Timetabling |
Fischer, Frank et al. |
2011 |
| 9 |
LP and SDP Branch-and-Cut Algorithms for the Minimum Graph Bisection Problem: A Computational Comparison |
Armbruster, Michael et al. |
2011 |
| 10 |
On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations |
Göring, Frank et al. |
2011 |
| 11 |
The rotational dimension of a graph |
Göring, Frank et al. |
2011 |
| 12 |
The Symmetric Quadratic Traveling Salesman Problem |
Fischer, Anja et al. |
2011 |
| 13 |
A note on Fiedler vectors interpreted as graph realizations |
Helmberg, Christoph et al. |
2010 |
| 14 |
A note on Fiedler vectors interpreted as graph realizations |
Helmberg, Christoph et al. |
2010 |
| 15 |
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling |
Fischer, Frank et al. |
2010 |
| 16 |
Integrating Energy Flows in Modeling Manufacturing Processes and Process Chains of Powertrain Components |
Götze, Uwe et al. |
2010 |
| 17 |
Planung energieeffizienter Fabriksysteme |
Götze, Uwe et al. |
2010 |
| 18 |
Graph Realizations Associated with Minimizing the Maximum Eigenvalue of the Laplacian |
Göring, Frank et al. |
2009 |
| 19 |
Network Models with Convex Cost Structure like Bundle Methods |
Helmberg, Christoph |
2009 |
| 20 |
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem |
Armbruster, Michael et al. |
2008 |
