| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Miguel F. Anjos, Etienne de Klerk, Franz Rendl |
Preface.  |
Math. Program.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Dukanovic, Franz Rendl |
Copositive programming motivated bounds on the stability and the chromatic numbers.  |
Math. Program.  |
2010 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C27, 90C22, 90C06 |
| 1 | Franz Rendl, Giovanni Rinaldi, Angelika Wiegele |
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations.  |
Math. Program.  |
2010 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C20, 90C27, 90C22 |
| 1 | Janez Povh, Franz Rendl |
Copositive and semidefinite relaxations of the quadratic assignment problem.  |
Discrete Optimization  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Malick, Janez Povh, Franz Rendl, Angelika Wiegele |
Regularization Methods for Semidefinite Programming.  |
SIAM Journal on Optimization  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Jarre, Franz Rendl |
An Augmented Primal-Dual Method for Linear Conic Programs.  |
SIAM Journal on Optimization  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Dukanovic, Franz Rendl |
A semidefinite programming-based heuristic for graph coloring.  |
Discrete Applied Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz Rendl |
Andrzej Ruszczynski, Nonlinear Optimization, Princeton University Press, Princeton, NJ, 2006, ISBN 0-691-11915-5, 464 pp., $ 59.50.  |
Oper. Res. Lett.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Janez Povh, Franz Rendl |
A Copositive Programming Approach to Graph Partitioning.  |
SIAM Journal on Optimization  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz Rendl, Renata Sotirov |
Bounds for the quadratic assignment problem using the bundle method.  |
Math. Program.  |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C22, 90C27, 90C57, 90C51, 90C06 |
| 1 | Igor Dukanovic, Franz Rendl |
Semidefinite programming relaxations for graph coloring and maximal clique problems.  |
Math. Program.  |
2007 |
DBLP DOI BibTeX RDF |
Lovász theta number, Clique number, Cutting planes, Chromatic number |
| 1 | Franz Rendl, Giovanni Rinaldi, Angelika Wiegele |
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.  |
IPCO  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Janez Povh, Franz Rendl, Angelika Wiegele |
A Boundary Point Method to Solve Semidefinite Programs.  |
Computing  |
2006 |
DBLP DOI BibTeX RDF |
augmented Lagrangian method, theta function, Semidefinite programming |
| 1 | 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.  |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C22, 90C27 |
| 1 | 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.  |
2005 |
DBLP DOI BibTeX RDF |
peptide and protein design and discovery, in silico sequence selection, de novo protein design, optimization, drug design, structure prediction |
| 1 | Karl Kunisch, Franz Rendl |
An Infeasible Active Set Method for Quadratic Problems with Simple Bounds.  |
SIAM Journal on Optimization  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerald Gruber, Franz Rendl |
Computational Experience with Stable Set Relaxations.  |
SIAM Journal on Optimization  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Lisser, Franz Rendl |
Graph partitioning using linear and semidefinite programming.  |
Math. Program.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles H. C. Little, Franz Rendl, Ilse Fischer |
Towards a characterisation of Pfaffian near bipartite graphs.  |
Discrete Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerald Gruber, Franz Rendl |
The Bundle Method for Hard Combinatorial Optimization Problems.  |
Combinatorial Optimization  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Helmberg, Franz Rendl, Robert Weismantel |
A Semidefinite Programming Approach to the Quadratic Knapsack Problem.  |
J. Comb. Optim.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Helmberg, Franz Rendl |
A Spectral Bundle Method for Semidefinite Programming.  |
SIAM Journal on Optimization  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan E. Karisch, Franz Rendl, Jens Clausen |
Solving Graph Bisection Problems with Semidefinite Programming.  |
INFORMS Journal on Computing  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel X. Goemans, Franz Rendl |
Semidefinite Programs and Association Schemes.  |
Computing  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry Wolkowicz |
Semidefinite Programming Relaxations for the Quadratic Assignment Problem.  |
J. Comb. Optim.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl |
Incorporating Inequality Constraints in the Spectral Bundle Method.  |
IPCO  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz Rendl, Henry Wolkowicz |
A semidefinite framework for trust region subproblems with applications to large scale minimization.  |
Math. Program.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Monique Laurent, Svatopluk Poljak, Franz Rendl |
Connections between semidefinite relaxations of the max-cut and stable set problems.  |
Math. Program.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Helmberg, Franz Rendl, Robert Weismantel |
Quadratic Knapsack Relaxations Using Cutting Planes.  |
IPCO  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Svatopluk Poljak, Franz Rendl |
Solving the Max-cut Problem Using Eigenvalues.  |
Discrete Applied Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan E. Karisch, Franz Rendl |
Lower bounds for the quadratic assignment problem via triangle decompositions.  |
Math. Program.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz |
Combining Semidefinite and Polyhedral Relaxations for Integer Programs.  |
IPCO  |
1995 |
DBLP DOI BibTeX RDF |
quadratic 0-1 optimization, integer linear programming, semidefinite programming, interior point methods |
| 1 | Svatopluk Poljak, Franz Rendl |
Node and edge relaxations of the Max-cut problem.  |
Computing  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Julie Falkner, Franz Rendl, Henry Wolkowicz |
A computational study of graph partitioning.  |
Math. Program.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz Rendl, Gerhard J. Woeginger |
Reconstructing sets of orthogonal line segments in the plane.  |
Discrete Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl |
A spectral approach to bandwidth and separator problems in graphs.  |
IPCO  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Hans Kellerer, Franz Rendl, Gerhard J. Woeginger |
Computing the optimum stock size.  |
IPCO  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Franz Rendl, Henry Wolkowicz |
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem.  |
Math. Program.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott W. Hadley, Franz Rendl, Henry Wolkowicz |
Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques.  |
IPCO  |
1990 |
DBLP BibTeX RDF |
|
| 1 | Franz Rendl, M. Leclerc |
A multiply constrained matroid optimization problem.  |
Discrete Mathematics  |
1989 |
DBLP DOI BibTeX RDF |
|