- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j37 |      | Philipp Hungerländer, Franz Rendl: A computational study and survey of methods for the single-row facility layout problem. Comp. Opt. and Appl. 55(1): 1-20 (2013) |
| 2012 | ||
| j36 | | Franz Rendl: Semidefinite relaxations for partitioning, assignment and ordering problems. 4OR 10(4): 321-346 (2012) |
| 2011 | ||
| j35 | | |
| j34 | | Immanuel M. Bomze, Florian Jarre, Franz Rendl: Quadratic factorization heuristics for copositive programming. Math. Program. Comput. 3(1): 37-57 (2011) |
| 2010 | ||
| j33 | | Igor Dukanovic, Franz Rendl: Copositive programming motivated bounds on the stability and the chromatic numbers. Math. Program. 121(2): 249-268 (2010) |
| j32 | | Franz Rendl, Giovanni Rinaldi, Angelika Wiegele: Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121(2): 307-335 (2010) |
| 2009 | ||
| j31 | | Janez Povh, Franz Rendl: Copositive and semidefinite relaxations of the quadratic assignment problem. Discrete Optimization 6(3): 231-241 (2009) |
| j30 | | Jérôme Malick, Janez Povh, Franz Rendl, Angelika Wiegele: Regularization Methods for Semidefinite Programming. SIAM Journal on Optimization 20(1): 336-356 (2009) |
| 2008 | ||
| j29 | | Igor Dukanovic, Franz Rendl: A semidefinite programming-based heuristic for graph coloring. Discrete Applied Mathematics 156(2): 180-189 (2008) |
| j28 | | Florian Jarre, Franz Rendl: An Augmented Primal-Dual Method for Linear Conic Programs. SIAM Journal on Optimization 19(2): 808-823 (2008) |
| 2007 | ||
| j27 | | Igor Dukanovic, Franz Rendl: Semidefinite programming relaxations for graph coloring and maximal clique problems. Math. Program. 109(2-3): 345-365 (2007) |
| j26 | | Franz Rendl, Renata Sotirov: Bounds for the quadratic assignment problem using the bundle method. Math. Program. 109(2-3): 505-524 (2007) |
| j25 | | Franz Rendl: Andrzej Ruszczynski, Nonlinear Optimization, Princeton University Press, Princeton, NJ, 2006, ISBN 0-691-11915-5, 464 pp., $ 59.50. Oper. Res. Lett. 35(4): 559-560 (2007) |
| j24 | | Janez Povh, Franz Rendl: A Copositive Programming Approach to Graph Partitioning. SIAM Journal on Optimization 18(1): 223-241 (2007) |
| c8 | | Franz Rendl, Giovanni Rinaldi, Angelika Wiegele: A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. IPCO 2007: 295-309 |
| 2006 | ||
| j23 | | Janez Povh, Franz Rendl, Angelika Wiegele: A Boundary Point Method to Solve Semidefinite Programs. Computing 78(3): 277-286 (2006) |
| j22 | | Ilse Fischer, Gerald Gruber, Franz Rendl, Renata Sotirov: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition. Math. Program. 105(2-3): 451-469 (2006) |
| 2005 | ||
| j21 | | Ho Ki Fung, S. Rao, Christodoulos A. Floudas, Oleg A. Prokopyev, Panos M. Pardalos, Franz Rendl: Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design. J. Comb. Optim. 10(1): 41-60 (2005) |
| 2003 | ||
| j20 | | Abdel Lisser, Franz Rendl: Graph partitioning using linear and semidefinite programming. Math. Program. 95(1): 91-101 (2003) |
| j19 | | Gerald Gruber, Franz Rendl: Computational Experience with Stable Set Relaxations. SIAM Journal on Optimization 13(4): 1014-1028 (2003) |
| j18 | | Karl Kunisch, Franz Rendl: An Infeasible Active Set Method for Quadratic Problems with Simple Bounds. SIAM Journal on Optimization 14(1): 35-52 (2003) |
| 2002 | ||
| j17 | | Gerald Gruber, Franz Rendl: Computational Experience with Ill-Posed Problems in Semidefinite Programming. Comp. Opt. and Appl. 21(2): 201-212 (2002) |
| j16 | | Charles H. C. Little, Franz Rendl, Ilse Fischer: Towards a characterisation of Pfaffian near bipartite graphs. Discrete Mathematics 244(1-3): 279-297 (2002) |
| 2001 | ||
| c7 | | Gerald Gruber, Franz Rendl: The Bundle Method for Hard Combinatorial Optimization Problems. Combinatorial Optimization 2001: 78-88 |
| 2000 | ||
| j15 | | Stefan E. Karisch, Franz Rendl, Jens Clausen: Solving Graph Bisection Problems with Semidefinite Programming. INFORMS Journal on Computing 12(3): 177-191 (2000) |
| j14 | | Christoph Helmberg, Franz Rendl, Robert Weismantel: A Semidefinite Programming Approach to the Quadratic Knapsack Problem. J. Comb. Optim. 4(2): 197-215 (2000) |
| j13 | | Christoph Helmberg, Franz Rendl: A Spectral Bundle Method for Semidefinite Programming. SIAM Journal on Optimization 10(3): 673-696 (2000) |
| 1999 | ||
| j12 | | Michel X. Goemans, Franz Rendl: Semidefinite Programs and Association Schemes. Computing 63(4): 331-340 (1999) |
| 1998 | ||
| j11 | | Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry Wolkowicz: Semidefinite Programming Relaxations for the Quadratic Assignment Problem. J. Comb. Optim. 2(1): 71-109 (1998) |
| c6 | | Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl: Incorporating Inequality Constraints in the Spectral Bundle Method. IPCO 1998: 423-436 |
| 1997 | ||
| j10 | | Monique Laurent, Svatopluk Poljak, Franz Rendl: Connections between semidefinite relaxations of the max-cut and stable set problems. Math. Program. 77: 225-246 (1997) |
| j9 | | Franz Rendl, Henry Wolkowicz: A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Program. 77: 273-299 (1997) |
| 1996 | ||
| c5 | | Christoph Helmberg, Franz Rendl, Robert Weismantel: Quadratic Knapsack Relaxations Using Cutting Planes. IPCO 1996: 175-189 |
| 1995 | ||
| j8 | | Svatopluk Poljak, Franz Rendl: Solving the Max-cut Problem Using Eigenvalues. Discrete Applied Mathematics 62(1-3): 249-278 (1995) |
| j7 | | |
| j6 | | Stefan E. Karisch, Franz Rendl: Lower bounds for the quadratic assignment problem via triangle decompositions. Math. Program. 71: 137-151 (1995) |
| c4 | | Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz: Combining Semidefinite and Polyhedral Relaxations for Integer Programs. IPCO 1995: 124-134 |
| 1994 | ||
| j5 | | Svatopluk Poljak, Franz Rendl: Node and edge relaxations of the Max-cut problem. Computing 52(2): 123-137 (1994) |
| j4 | | Julie Falkner, Franz Rendl, Henry Wolkowicz: A computational study of graph partitioning. Math. Program. 66: 211-239 (1994) |
| 1993 | ||
| j3 | | Franz Rendl, Gerhard J. Woeginger: Reconstructing sets of orthogonal line segments in the plane. Discrete Mathematics 119(1-3): 167-174 (1993) |
| c3 |  | Hans Kellerer, Franz Rendl, Gerhard J. Woeginger: Computing the optimum stock size. IPCO 1993: 147-159 |
| c2 | | Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl: A spectral approach to bandwidth and separator problems in graphs. IPCO 1993: 183-194 |
| 1992 | ||
| j2 | | Franz Rendl, Henry Wolkowicz: Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Math. Program. 53: 63-78 (1992) |
| 1990 | ||
| c1 | | Scott W. Hadley, Franz Rendl, Henry Wolkowicz: Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques. IPCO 1990: 237-248 |
| 1989 | ||
| j1 | | Franz Rendl, M. Leclerc: A multiply constrained matroid optimization problem. Discrete Mathematics 73(1-2): 207-212 (1989) |
Colors in the list of coauthors
Last update Mon May 20 10:45:39 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page