Franz Rendl

Publication Activity (10 Years)

Years Active: 1985-2022
Publications (10 Years): 12

Top Topics

Optimization Problems

Top Venues

Oper. Res. Lett.

Comput. Optim. Appl.

Publications

Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz
In memoriam Gerhard Woeginger. J. Sched. 25 (5) (2022)
Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz
In memoriam Gerhard Woeginger. Oper. Res. Lett. 50 (3) (2022)
Franz Rendl, Renata Sotirov, Christian Truden
Lower bounds for the bandwidth problem. Comput. Oper. Res. 135 (2021)
Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics 26 (2021)
Mirjam Dür, Franz Rendl
Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems. EURO J. Comput. Optim. 9 (2021)
Elisabeth Gaar, Franz Rendl
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. Math. Program. 183 (1) (2020)
Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. CoRR (2019)
Elisabeth Gaar, Franz Rendl
A Bundle Approach for SDPs with Exact Subgraph Constraints. IPCO (2019)
Satoru Fujishige, Ali Ridha Mahjoub, Franz Rendl
Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016. J. Comb. Optim. 37 (1) (2019)
Marianna De Santis, Franz Rendl, Angelika Wiegele
Using a factored dual in augmented Lagrangian methods for semidefinite programming. Oper. Res. Lett. 46 (5) (2018)
Franz Rendl, Renata Sotirov
The min-cut and vertex separator problem. Comput. Optim. Appl. 69 (1) (2018)
Franz Rendl
Semidefinite relaxations for partitioning, assignment and ordering problems. Ann. Oper. Res. 240 (1) (2016)
Philipp Hungerländer, Franz Rendl
A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds. SIAM J. Optim. 25 (3) (2015)
Elspeth Adams, Miguel F. Anjos, Franz Rendl, Angelika Wiegele
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems. INFOR Inf. Syst. Oper. Res. 53 (1) (2015)
Christoph Helmberg, Michael L. Overton, Franz Rendl
The spectral bundle method with second-order information. Optim. Methods Softw. 29 (4) (2014)
Philipp Hungerländer, Franz Rendl
A computational study and survey of methods for the single-row facility layout problem. Comput. Optim. Appl. 55 (1) (2013)
Philipp Hungerländer, Franz Rendl
Semidefinite relaxations of ordering problems. Math. Program. 140 (1) (2013)
Franz Rendl
Semidefinite relaxations for partitioning, assignment and ordering problems. 4OR 10 (4) (2012)
Immanuel M. Bomze, Florian Jarre, Franz Rendl
Quadratic factorization heuristics for copositive programming. Math. Program. Comput. 3 (1) (2011)
Miguel F. Anjos, Etienne de Klerk, Franz Rendl
Preface. Math. Program. 129 (1) (2011)
Igor Dukanovic, Franz Rendl
Copositive programming motivated bounds on the stability and the chromatic numbers. Math. Program. 121 (2) (2010)
Franz Rendl, Giovanni Rinaldi, Angelika Wiegele
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121 (2) (2010)
Jérôme Malick, Janez Povh, Franz Rendl, Angelika Wiegele
Regularization Methods for Semidefinite Programming. SIAM J. Optim. 20 (1) (2009)
Janez Povh, Franz Rendl
Copositive and semidefinite relaxations of the quadratic assignment problem. Discret. Optim. 6 (3) (2009)
Igor Dukanovic, Franz Rendl
A semidefinite programming-based heuristic for graph coloring. Discret. Appl. Math. 156 (2) (2008)
Florian Jarre, Franz Rendl
An Augmented Primal-Dual Method for Linear Conic Programs. SIAM J. Optim. 19 (2) (2008)
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) (2007)
Igor Dukanovic, Franz Rendl
Semidefinite programming relaxations for graph coloring and maximal clique problems. Math. Program. 109 (2-3) (2007)
Franz Rendl, Giovanni Rinaldi, Angelika Wiegele
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. IPCO (2007)
Franz Rendl, Renata Sotirov
Bounds for the quadratic assignment problem using the bundle method. Math. Program. 109 (2-3) (2007)
Janez Povh, Franz Rendl
A Copositive Programming Approach to Graph Partitioning. SIAM J. Optim. 18 (1) (2007)
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) (2006)
Janez Povh, Franz Rendl, Angelika Wiegele
A Boundary Point Method to Solve Semidefinite Programs. Computing 78 (3) (2006)
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) (2005)
Abdel Lisser, Franz Rendl
Graph partitioning using linear and semidefinite programming. Math. Program. 95 (1) (2003)
Karl Kunisch, Franz Rendl
An Infeasible Active Set Method for Quadratic Problems with Simple Bounds. SIAM J. Optim. 14 (1) (2003)
Gerald Gruber, Franz Rendl
Computational Experience with Stable Set Relaxations. SIAM J. Optim. 13 (4) (2003)
Gerald Gruber, Franz Rendl
Computational Experience with Ill-Posed Problems in Semidefinite Programming. Comput. Optim. Appl. 21 (2) (2002)
Charles H. C. Little, Franz Rendl, Ilse Fischer
Towards a characterisation of Pfaffian near bipartite graphs. Discret. Math. 244 (1-3) (2002)
Gerald Gruber, Franz Rendl
The Bundle Method for Hard Combinatorial Optimization Problems. Combinatorial Optimization (2001)
Stefan E. Karisch, Franz Rendl, Jens Clausen
Solving Graph Bisection Problems with Semidefinite Programming. INFORMS J. Comput. 12 (3) (2000)
Christoph Helmberg, Franz Rendl
A Spectral Bundle Method for Semidefinite Programming. SIAM J. Optim. 10 (3) (2000)
Christoph Helmberg, Franz Rendl, Robert Weismantel
A Semidefinite Programming Approach to the Quadratic Knapsack Problem. J. Comb. Optim. 4 (2) (2000)
Michel X. Goemans, Franz Rendl
Semidefinite Programs and Association Schemes. Computing 63 (4) (1999)
Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger
The Stock Size Problem. Oper. Res. 46 (3-Supplement-3) (1998)
Jens Clausen, Stefan E. Karisch, Michael Perregaard, Franz Rendl
On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel. Comput. Optim. Appl. 10 (2) (1998)
Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry Wolkowicz
Semidefinite Programming Relaxations for the Quadratic Assignment Problem. J. Comb. Optim. 2 (1) (1998)
Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl
Incorporating Inequality Constraints in the Spectral Bundle Method. IPCO (1998)
Monique Laurent, Svatopluk Poljak, Franz Rendl
Connections between semidefinite relaxations of the max-cut and stable set problems. Math. Program. 77 (1997)
Franz Rendl, Henry Wolkowicz
A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Program. 77 (1997)
Rainer E. Burkard, Stefan E. Karisch, Franz Rendl
QAPLIB - A Quadratic Assignment Problem Library. J. Glob. Optim. 10 (4) (1997)
Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz
An Interior-Point Method for Semidefinite Programming. SIAM J. Optim. 6 (2) (1996)
Christoph Helmberg, Franz Rendl, Robert Weismantel
Quadratic Knapsack Relaxations Using Cutting Planes. IPCO (1996)
Svatopluk Poljak, Franz Rendl
Solving the Max-cut Problem Using Eigenvalues. Discret. Appl. Math. 62 (1-3) (1995)
Svatopluk Poljak, Franz Rendl, Henry Wolkowicz
A recipe for semidefinite relaxation for (0, 1)-quadratic programming - In memory of Svata Poljak. J. Glob. Optim. 7 (1) (1995)
Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz
Combining Semidefinite and Polyhedral Relaxations for Integer Programs. IPCO (1995)
Svatopluk Poljak, Franz Rendl
Nonpolyhedral Relaxations of Graph-Bisection Problems. SIAM J. Optim. 5 (3) (1995)
Stefan E. Karisch, Franz Rendl
Lower bounds for the quadratic assignment problem via triangle decompositions. Math. Program. 71 (1995)
Franz Rendl, Henry Wolkowicz
A projection technique for partitioning the nodes of a graph. Ann. Oper. Res. 58 (3) (1995)
Franz Rendl
Book review. Math. Methods Oper. Res. 41 (1) (1995)
Julie Falkner, Franz Rendl, Henry Wolkowicz
A computational study of graph partitioning. Math. Program. 66 (1994)
Svatopluk Poljak, Franz Rendl
Node and edge relaxations of the Max-cut problem. Computing 52 (2) (1994)
Stefan E. Karisch, Franz Rendl, Henry Wolkowicz
Trust Regions and Relaxations for the Quadratic Assignment Problem. Quadratic Assignment and Related Problems (1993)
Franz Rendl, Gerhard J. Woeginger
Reconstructing sets of orthogonal line segments in the plane. Discret. Math. 119 (1-3) (1993)
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl
A spectral approach to bandwidth and separator problems in graphs. IPCO (1993)
Panos M. Pardalos, Franz Rendl, Henry Wolkowicz
The Quadratic Assignment Problem: A Survey and Recent Developments. Quadratic Assignment and Related Problems (1993)
Hans Kellerer, Franz Rendl, Gerhard J. Woeginger
Computing the optimum stock size. IPCO (1993)
Franz Rendl, Henry Wolkowicz
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Math. Program. 53 (1992)
Scott W. Hadley, Franz Rendl, Henry Wolkowicz
A New Lower Bound Via Projection for the Quadratic Assignment Problem. Math. Oper. Res. 17 (3) (1992)
Horst W. Hamacher, Franz Rendl
Color constrained combinatorial optimization problems. Oper. Res. Lett. 10 (4) (1991)
Rainer E. Burkard, Franz Rendl
Lexicographic bottleneck problems. Oper. Res. Lett. 10 (5) (1991)
Scott W. Hadley, Franz Rendl, Henry Wolkowicz
Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques. IPCO (1990)
Matthias Leclerc, Franz Rendl
-Best constrained bases of a matroid. ZOR Methods Model. Oper. Res. 34 (2) (1990)
Franz Rendl, Matthias Leclerc
A multiply constrained matroid optimization problem. Discret. Math. 73 (1-2) (1989)
Franz Rendl
Quadratic assignment problems on series-parallel digraphs. Z. Oper. Research 30 (3) (1986)
Franz Rendl
Book reviews. Z. Oper. Research 29 (7) (1985)