Search the dblp DataBase

Publications of Author

1. Kurt M. Anstreicher, Dick den Hertog, Cornelis Roos, Tamás Terlaky
   A Long-Step Barrier Method for Convex Quadratic Programming. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1993, v:10, n:5, pp:365-382 [Journal]
   
2. Cornelis Roos, A. Snijders, A. J. van Zanten
   Cyclonomial Number Systems and the Ranking of Lexicographically Ordered Constant-Sum Codes. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 1998, v:48, n:, pp:- [Journal]
   
3. Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen
   A Potential Reduction Approach to the Frequency Assignment Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:251-282 [Journal]
   
4. Etienne de Klerk, Cornelis Roos, Tamás Terlaky
   Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 1998, v:2, n:1, pp:51-69 [Journal]
   
5. Cornelis Roos, A. J. van Zanten
   On the existence of certain distance-regular graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1982, v:33, n:3, pp:197-212 [Journal]
   
6. Aharon Ben-Tal, Arkadi Nemirovski, Cornelis Roos
   Extended Matrix Cube Theorems with Applications to µ-Theory in Control. [Citation Graph (0, 0)][DBLP]
   Math. Oper. Res., 2003, v:28, n:3, pp:497-523 [Journal]
   
7. Erling D. Andersen, Cornelis Roos, Tamás Terlaky
   On implementing a primal-dual interior-point method for conic quadratic optimization. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:2, pp:249-277 [Journal]
   
8. Cornelis Roos, Tamás Terlaky
   Note on a paper of Broyden. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1999, v:25, n:4, pp:183-186 [Journal]
   
9. Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen
   Potential reduction algorithms for structured combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:2, pp:55-64 [Journal]
   
10. Jiming Peng, Cornelis Roos, Tamás Terlaky
    A new class of polynomial primal-dual methods for linear and semidefinite optimization. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:143, n:2, pp:234-256 [Journal]
    
11. 
    Primal-dual algorithm for linear optimization problems based on a new class of kernel functions. [Citation Graph (, )][DBLP]
    
    
12. 
    Modelling Some Robust Design Problems via Conic Optimization. [Citation Graph (, )][DBLP]
    
    
13. 
    The Robust Shortest Path Problem by Means of Robust Linear Optimization. [Citation Graph (, )][DBLP]