Franz Rendl - RankMe

78 papers B 8Journal 64Unranked 3

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	In memoriam Gerhard Woeginger. Oper. Res. Lett. Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz
2022	J	`jnl`	In memoriam Gerhard Woeginger. J. Sched. Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz
2021	J	`jnl`	Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems. EURO J. Comput. Optim. Mirjam Dür, Franz Rendl
2021	J	`jnl`	Lower bounds for the bandwidth problem. Comput. Oper. Res. Franz Rendl, Renata Sotirov, Christian Truden
2021	J	`jnl`	Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
2020	J	`jnl`	A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. Math. Program. Elisabeth Gaar, Franz Rendl
2019	B	`conf`	A Bundle Approach for SDPs with Exact Subgraph Constraints. IPCO Elisabeth Gaar, Franz Rendl
2019	J	`jnl`	Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. CoRR Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
2019	J	`jnl`	Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016. J. Comb. Optim. Satoru Fujishige, Ali Ridha Mahjoub, Franz Rendl
2018	J	`jnl`	The min-cut and vertex separator problem. Comput. Optim. Appl. Franz Rendl, Renata Sotirov
2018	J	`jnl`	Using a factored dual in augmented Lagrangian methods for semidefinite programming. Oper. Res. Lett. Marianna De Santis, Franz Rendl, Angelika Wiegele
2016	J	`jnl`	Semidefinite relaxations for partitioning, assignment and ordering problems. Ann. Oper. Res. Franz Rendl
2015	J	`jnl`	A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds. SIAM J. Optim. Philipp Hungerländer, Franz Rendl
2015	J	`jnl`	A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems. INFOR Inf. Syst. Oper. Res. Elspeth Adams, Miguel F. Anjos, Franz Rendl, Angelika Wiegele
2014	—	`ed.`	System Modeling and Optimization - 26th IFIP TC 7 Conference, CSMO 2013, Klagenfurt, Austria, September 9-13, 2013, Revised Selected Papers System Modeling and Optimization Christian Pötzsche, Clemens Heuberger, Barbara Kaltenbacher, Franz Rendl
2014	J	`jnl`	The spectral bundle method with second-order information. Optim. Methods Softw. Christoph Helmberg, Michael L. Overton, Franz Rendl
2013	J	`jnl`	A computational study and survey of methods for the single-row facility layout problem. Comput. Optim. Appl. Philipp Hungerländer, Franz Rendl
2013	J	`jnl`	Semidefinite relaxations of ordering problems. Math. Program. Philipp Hungerländer, Franz Rendl
2012	J	`jnl`	Semidefinite relaxations for partitioning, assignment and ordering problems. 4OR Franz Rendl
2011	J	`jnl`	Preface. Math. Program. Miguel F. Anjos, Etienne de Klerk, Franz Rendl
2011	J	`jnl`	Quadratic factorization heuristics for copositive programming. Math. Program. Comput. Immanuel M. Bomze, Florian Jarre, Franz Rendl
2010	J	`jnl`	Copositive programming motivated bounds on the stability and the chromatic numbers. Math. Program. Igor Dukanovic, Franz Rendl
2010	—	`ch.`	Semidefinite Relaxations for Integer Programming. 50 Years of Integer Programming Franz Rendl
2010	J	`jnl`	Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. Franz Rendl, Giovanni Rinaldi, Angelika Wiegele
2009	J	`jnl`	Copositive and semidefinite relaxations of the quadratic assignment problem. Discret. Optim. Janez Povh, Franz Rendl
2009	J	`jnl`	Regularization Methods for Semidefinite Programming. SIAM J. Optim. Jérôme Malick, Janez Povh, Franz Rendl, Angelika Wiegele
2008	J	`jnl`	A semidefinite programming-based heuristic for graph coloring. Discret. Appl. Math. Igor Dukanovic, Franz Rendl
2008	J	`jnl`	An Augmented Primal-Dual Method for Linear Conic Programs. SIAM J. Optim. Florian Jarre, Franz Rendl
2007	B	`conf`	A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. IPCO Franz Rendl, Giovanni Rinaldi, Angelika Wiegele
2007	J	`jnl`	A Copositive Programming Approach to Graph Partitioning. SIAM J. Optim. Janez Povh, Franz Rendl
2007	J	`jnl`	Andrzej Ruszczynski, Nonlinear Optimization, Princeton University Press, Princeton, NJ, 2006, ISBN 0-691-11915-5, 464 pp., $ 59.50. Oper. Res. Lett. Franz Rendl
2007	J	`jnl`	Bounds for the quadratic assignment problem using the bundle method. Math. Program. Franz Rendl, Renata Sotirov
2007	J	`jnl`	Semidefinite programming relaxations for graph coloring and maximal clique problems. Math. Program. Igor Dukanovic, Franz Rendl
2006	J	`jnl`	A Boundary Point Method to Solve Semidefinite Programs. Computing Janez Povh, Franz Rendl, Angelika Wiegele
2006	J	`jnl`	Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition. Math. Program. Ilse Fischer, Gerald Gruber, Franz Rendl, Renata Sotirov
2005	J	`jnl`	Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design. J. Comb. Optim. Ho Ki Fung, S. Rao, Christodoulos A. Floudas, Oleg A. Prokopyev, Panos M. Pardalos, Franz Rendl
2003	J	`jnl`	An Infeasible Active Set Method for Quadratic Problems with Simple Bounds. SIAM J. Optim. Karl Kunisch, Franz Rendl
2003	J	`jnl`	Computational Experience with Stable Set Relaxations. SIAM J. Optim. Gerald Gruber, Franz Rendl
2003	J	`jnl`	Graph partitioning using linear and semidefinite programming. Math. Program. Abdel Lisser, Franz Rendl
2003	—	`ed.`	Operations Research Proceedings 2002, Selected Papers of the International Conference on Operations Research (SOR 2002), Klagenfurt, Austria, September 2-5, 2002 OR Ulrike Leopold-Wildburger, Franz Rendl, Gerhard Wäscher
2002	J	`jnl`	Computational Experience with Ill-Posed Problems in Semidefinite Programming. Comput. Optim. Appl. Gerald Gruber, Franz Rendl
2002	J	`jnl`	Towards a characterisation of Pfaffian near bipartite graphs. Discret. Math. Charles H. C. Little, Franz Rendl, Ilse Fischer
2001	—	`conf`	The Bundle Method for Hard Combinatorial Optimization Problems. Combinatorial Optimization Gerald Gruber, Franz Rendl
2000	J	`jnl`	A Semidefinite Programming Approach to the Quadratic Knapsack Problem. J. Comb. Optim. Christoph Helmberg, Franz Rendl, Robert Weismantel
2000	J	`jnl`	A Spectral Bundle Method for Semidefinite Programming. SIAM J. Optim. Christoph Helmberg, Franz Rendl
2000	J	`jnl`	Solving Graph Bisection Problems with Semidefinite Programming. INFORMS J. Comput. Stefan E. Karisch, Franz Rendl, Jens Clausen
1999	J	`jnl`	Semidefinite Programs and Association Schemes. Computing Michel X. Goemans, Franz Rendl
1998	B	`conf`	Incorporating Inequality Constraints in the Spectral Bundle Method. IPCO Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl
1998	J	`jnl`	On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel. Comput. Optim. Appl. Jens Clausen, Stefan E. Karisch, Michael Perregaard, Franz Rendl
1998	J	`jnl`	Semidefinite Programming Relaxations for the Quadratic Assignment Problem. J. Comb. Optim. Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry Wolkowicz
1998	J	`jnl`	The Stock Size Problem. Oper. Res. Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger
1997	J	`jnl`	A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Program. Franz Rendl, Henry Wolkowicz
1997	J	`jnl`	Connections between semidefinite relaxations of the max-cut and stable set problems. Math. Program. Monique Laurent, Svatopluk Poljak, Franz Rendl
1997	J	`jnl`	QAPLIB - A Quadratic Assignment Problem Library. J. Glob. Optim. Rainer E. Burkard, Stefan E. Karisch, Franz Rendl
1996	J	`jnl`	An Interior-Point Method for Semidefinite Programming. SIAM J. Optim. Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz
1996	B	`conf`	Quadratic Knapsack Relaxations Using Cutting Planes. IPCO Christoph Helmberg, Franz Rendl, Robert Weismantel
1995	J	`jnl`	A projection technique for partitioning the nodes of a graph. Ann. Oper. Res. Franz Rendl, Henry Wolkowicz
1995	J	`jnl`	A recipe for semidefinite relaxation for (0, 1)-quadratic programming - In memory of Svata Poljak. J. Glob. Optim. Svatopluk Poljak, Franz Rendl, Henry Wolkowicz
1995	J	`jnl`	Book review. Math. Methods Oper. Res. Franz Rendl
1995	B	`conf`	Combining Semidefinite and Polyhedral Relaxations for Integer Programs. IPCO Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz
1995	J	`jnl`	Lower bounds for the quadratic assignment problem via triangle decompositions. Math. Program. Stefan E. Karisch, Franz Rendl
1995	J	`jnl`	Nonpolyhedral Relaxations of Graph-Bisection Problems. SIAM J. Optim. Svatopluk Poljak, Franz Rendl
1995	J	`jnl`	Solving the Max-cut Problem Using Eigenvalues. Discret. Appl. Math. Svatopluk Poljak, Franz Rendl
1994	J	`jnl`	A computational study of graph partitioning. Math. Program. Julie Falkner, Franz Rendl, Henry Wolkowicz
1994	J	`jnl`	Node and edge relaxations of the Max-cut problem. Computing Svatopluk Poljak, Franz Rendl
1993	B	`conf`	A spectral approach to bandwidth and separator problems in graphs. IPCO Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl
1993	B	`conf`	Computing the optimum stock size. IPCO Hans Kellerer, Franz Rendl, Gerhard J. Woeginger
1993	J	`jnl`	Reconstructing sets of orthogonal line segments in the plane. Discret. Math. Franz Rendl, Gerhard J. Woeginger
1993	—	`conf`	The Quadratic Assignment Problem: A Survey and Recent Developments. Quadratic Assignment and Related Problems Panos M. Pardalos, Franz Rendl, Henry Wolkowicz
1993	—	`conf`	Trust Regions and Relaxations for the Quadratic Assignment Problem. Quadratic Assignment and Related Problems Stefan E. Karisch, Franz Rendl, Henry Wolkowicz
1992	J	`jnl`	A New Lower Bound Via Projection for the Quadratic Assignment Problem. Math. Oper. Res. Scott W. Hadley, Franz Rendl, Henry Wolkowicz
1992	J	`jnl`	Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Math. Program. Franz Rendl, Henry Wolkowicz
1991	J	`jnl`	Color constrained combinatorial optimization problems. Oper. Res. Lett. Horst W. Hamacher, Franz Rendl
1991	J	`jnl`	Lexicographic bottleneck problems. Oper. Res. Lett. Rainer E. Burkard, Franz Rendl
1990	B	`conf`	Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques. IPCO Scott W. Hadley, Franz Rendl, Henry Wolkowicz
1989	J	`jnl`	A multiply constrained matroid optimization problem. Discret. Math. Franz Rendl, Matthias Leclerc
1986	J	`jnl`	Quadratic assignment problems on series-parallel digraphs. Z. Oper. Research Franz Rendl
1985	J	`jnl`	Book reviews. Z. Oper. Research Franz Rendl