Franz Rendl

According to our database, Franz Rendl authored at least 75 papers between 1985 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

In memoriam Gerhard Woeginger.

Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz

Oper. Res. Lett., 2022

2021

Quantum Annealing versus Digital Computing: An Experimental Comparison.

Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk

ACM J. Exp. Algorithmics, 2021

Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems.

Mirjam Dür, Franz Rendl

EURO J. Comput. Optim., 2021

Lower bounds for the bandwidth problem.

Franz Rendl, Renata Sotirov, Christian Truden

Comput. Oper. Res., 2021

2020

A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring.

Elisabeth Gaar, Franz Rendl

Math. Program., 2020

2019

Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016.

Satoru Fujishige, Ali Ridha Mahjoub, Franz Rendl

J. Comb. Optim., 2019

Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs.

Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk

CoRR, 2019

A Bundle Approach for SDPs with Exact Subgraph Constraints.

Elisabeth Gaar, Franz Rendl

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

Using a factored dual in augmented Lagrangian methods for semidefinite programming.

Marianna De Santis, Franz Rendl, Angelika Wiegele

Oper. Res. Lett., 2018

The min-cut and vertex separator problem.

Franz Rendl, Renata Sotirov

Comput. Optim. Appl., 2018

2016

Semidefinite relaxations for partitioning, assignment and ordering problems.

Franz Rendl

Ann. Oper. Res., 2016

2015

A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds.

Philipp Hungerländer, Franz Rendl

SIAM J. Optim., 2015

A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems.

Elspeth Adams, Miguel F. Anjos, Franz Rendl, Angelika Wiegele

INFOR Inf. Syst. Oper. Res., 2015

2014

The spectral bundle method with second-order information.

Christoph Helmberg, Michael L. Overton, Franz Rendl

Optim. Methods Softw., 2014

2013

Semidefinite relaxations of ordering problems.

Philipp Hungerländer, Franz Rendl

Math. Program., 2013

A computational study and survey of methods for the single-row facility layout problem.

Philipp Hungerländer, Franz Rendl

Comput. Optim. Appl., 2013

2011

Quadratic factorization heuristics for copositive programming.

Immanuel M. Bomze, Florian Jarre, Franz Rendl

Math. Program. Comput., 2011

Preface.

Miguel F. Anjos, Etienne de Klerk, Franz Rendl

Math. Program., 2011

2010

Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations.

Franz Rendl, Giovanni Rinaldi, Angelika Wiegele

Math. Program., 2010

Copositive programming motivated bounds on the stability and the chromatic numbers.

Igor Dukanovic, Franz Rendl

Math. Program., 2010

Semidefinite Relaxations for Integer Programming.

Franz Rendl

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

Regularization Methods for Semidefinite Programming.

Jérôme Malick, Janez Povh, Franz Rendl, Angelika Wiegele

SIAM J. Optim., 2009

Copositive and semidefinite relaxations of the quadratic assignment problem.

Janez Povh, Franz Rendl

Discret. Optim., 2009

2008

An Augmented Primal-Dual Method for Linear Conic Programs.

Florian Jarre, Franz Rendl

SIAM J. Optim., 2008

A semidefinite programming-based heuristic for graph coloring.

Igor Dukanovic, Franz Rendl

Discret. Appl. Math., 2008

2007

A Copositive Programming Approach to Graph Partitioning.

Janez Povh, Franz Rendl

SIAM J. Optim., 2007

Andrzej Ruszczynski, Nonlinear Optimization, Princeton University Press, Princeton, NJ, 2006, ISBN 0-691-11915-5, 464 pp., $ 59.50.

Franz Rendl

Oper. Res. Lett., 2007

Bounds for the quadratic assignment problem using the bundle method.

Franz Rendl, Renata Sotirov

Math. Program., 2007

Semidefinite programming relaxations for graph coloring and maximal clique problems.

Igor Dukanovic, Franz Rendl

Math. Program., 2007

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.

Franz Rendl, Giovanni Rinaldi, Angelika Wiegele

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition.

Ilse Fischer, Gerald Gruber, Franz Rendl, Renata Sotirov

Math. Program., 2006

A Boundary Point Method to Solve Semidefinite Programs.

Janez Povh, Franz Rendl, Angelika Wiegele

Computing, 2006

2005

Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design.

Ho Ki Fung, S. Rao, Christodoulos A. Floudas, Oleg A. Prokopyev, Panos M. Pardalos, Franz Rendl

J. Comb. Optim., 2005

2003

An Infeasible Active Set Method for Quadratic Problems with Simple Bounds.

Karl Kunisch, Franz Rendl

SIAM J. Optim., 2003

Computational Experience with Stable Set Relaxations.

Gerald Gruber, Franz Rendl

SIAM J. Optim., 2003

Graph partitioning using linear and semidefinite programming.

Abdel Lisser, Franz Rendl

Math. Program., 2003

2002

Towards a characterisation of Pfaffian near bipartite graphs.

Charles H. C. Little, Franz Rendl, Ilse Fischer

Discret. Math., 2002

Computational Experience with Ill-Posed Problems in Semidefinite Programming.

Gerald Gruber, Franz Rendl

Comput. Optim. Appl., 2002

2001

The Bundle Method for Hard Combinatorial Optimization Problems.

Gerald Gruber, Franz Rendl

Proceedings of the Combinatorial Optimization, 2001

2000

A Spectral Bundle Method for Semidefinite Programming.

Christoph Helmberg, Franz Rendl

SIAM J. Optim., 2000

A Semidefinite Programming Approach to the Quadratic Knapsack Problem.

Christoph Helmberg, Franz Rendl, Robert Weismantel

J. Comb. Optim., 2000

Solving Graph Bisection Problems with Semidefinite Programming.

Stefan E. Karisch, Franz Rendl, Jens Clausen

INFORMS J. Comput., 2000

1999

Semidefinite Programs and Association Schemes.

Michel X. Goemans, Franz Rendl

Computing, 1999

1998

Semidefinite Programming Relaxations for the Quadratic Assignment Problem.

Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry Wolkowicz

J. Comb. Optim., 1998

The Stock Size Problem.

Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger

Oper. Res., 1998

On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel.

Jens Clausen, Stefan E. Karisch, Michael Perregaard, Franz Rendl

Comput. Optim. Appl., 1998

Incorporating Inequality Constraints in the Spectral Bundle Method.

Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

A semidefinite framework for trust region subproblems with applications to large scale minimization.

Franz Rendl, Henry Wolkowicz

Math. Program., 1997

Connections between semidefinite relaxations of the max-cut and stable set problems.

Monique Laurent, Svatopluk Poljak, Franz Rendl

Math. Program., 1997

QAPLIB - A Quadratic Assignment Problem Library.

Rainer E. Burkard, Stefan E. Karisch, Franz Rendl

J. Glob. Optim., 1997

1996

An Interior-Point Method for Semidefinite Programming.

Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz

SIAM J. Optim., 1996

Quadratic Knapsack Relaxations Using Cutting Planes.

Christoph Helmberg, Franz Rendl, Robert Weismantel

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

Nonpolyhedral Relaxations of Graph-Bisection Problems.

Svatopluk Poljak, Franz Rendl

SIAM J. Optim., 1995

Lower bounds for the quadratic assignment problem via triangle decompositions.

Stefan E. Karisch, Franz Rendl

Math. Program., 1995

Book review.

Franz Rendl

Math. Methods Oper. Res., 1995

A recipe for semidefinite relaxation for (0, 1)-quadratic programming - In memory of Svata Poljak.

Svatopluk Poljak, Franz Rendl, Henry Wolkowicz

J. Glob. Optim., 1995

Solving the Max-cut Problem Using Eigenvalues.

Svatopluk Poljak, Franz Rendl

Discret. Appl. Math., 1995

A projection technique for partitioning the nodes of a graph.

Franz Rendl, Henry Wolkowicz

Ann. Oper. Res., 1995

Combining Semidefinite and Polyhedral Relaxations for Integer Programs.

Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

A computational study of graph partitioning.

Julie Falkner, Franz Rendl, Henry Wolkowicz

Math. Program., 1994

Node and edge relaxations of the Max-cut problem.

Svatopluk Poljak, Franz Rendl

Computing, 1994

1993

Reconstructing sets of orthogonal line segments in the plane.

Franz Rendl, Gerhard J. Woeginger

Discret. Math., 1993

Computing the optimum stock size.

Hans Kellerer, Franz Rendl, Gerhard J. Woeginger

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

A spectral approach to bandwidth and separator problems in graphs.

Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

The Quadratic Assignment Problem: A Survey and Recent Developments.

Panos M. Pardalos, Franz Rendl, Henry Wolkowicz

Proceedings of the Quadratic Assignment and Related Problems, 1993

Trust Regions and Relaxations for the Quadratic Assignment Problem.

Stefan E. Karisch, Franz Rendl, Henry Wolkowicz

Proceedings of the Quadratic Assignment and Related Problems, 1993

1992

Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem.

Franz Rendl, Henry Wolkowicz

Math. Program., 1992

A New Lower Bound Via Projection for the Quadratic Assignment Problem.

Scott W. Hadley, Franz Rendl, Henry Wolkowicz

Math. Oper. Res., 1992

1991

Color constrained combinatorial optimization problems.

Horst W. Hamacher, Franz Rendl

Oper. Res. Lett., 1991

Lexicographic bottleneck problems.

Rainer E. Burkard, Franz Rendl

Oper. Res. Lett., 1991

1990

<i>k</i>-Best constrained bases of a matroid.

Matthias Leclerc, Franz Rendl

ZOR Methods Model. Oper. Res., 1990

Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques.

Scott W. Hadley, Franz Rendl, Henry Wolkowicz

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989

A multiply constrained matroid optimization problem.

Franz Rendl, Matthias Leclerc

Discret. Math., 1989

1986

Quadratic assignment problems on series-parallel digraphs.

Franz Rendl

Z. Oper. Research, 1986

1985

Book reviews.

Franz Rendl

Z. Oper. Research, 1985