default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranz Rendl
Person information
- affiliation: University of Klagenfurt, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j64]Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma
, Marc Uetz:
In memoriam Gerhard Woeginger. Oper. Res. Lett. 50(3): iii (2022)- [j63]Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz:
In memoriam Gerhard Woeginger. J. Sched. 25(5): 503-505 (2022) - 2021
- [j62]Franz Rendl, Renata Sotirov, Christian Truden:
Lower bounds for the bandwidth problem. Comput. Oper. Res. 135: 105422 (2021) - [j61]Mirjam Dür, Franz Rendl:
Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems. EURO J. Comput. Optim. 9: 100021 (2021) - [j60]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: 1.9:1-1.9:30 (2021) - 2020
- [j59]Elisabeth Gaar, Franz Rendl:
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. Math. Program. 183(1): 283-308 (2020)
2010 – 2019
- 2019
- [j58]Satoru Fujishige, Ali Ridha Mahjoub, Franz Rendl:
Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016. J. Comb. Optim. 37(1): 418-422 (2019) - [c11]Elisabeth Gaar, Franz Rendl:
A Bundle Approach for SDPs with Exact Subgraph Constraints. IPCO 2019: 205-218 - [i1]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 abs/1904.11965 (2019) - 2018
- [j57]Franz Rendl, Renata Sotirov:
The min-cut and vertex separator problem. Comput. Optim. Appl. 69(1): 159-187 (2018) - [j56]Marianna De Santis, Franz Rendl, Angelika Wiegele:
Using a factored dual in augmented Lagrangian methods for semidefinite programming. Oper. Res. Lett. 46(5): 523-528 (2018) - 2016
- [j55]Franz Rendl:
Semidefinite relaxations for partitioning, assignment and ordering problems. Ann. Oper. Res. 240(1): 119-140 (2016) - 2015
- [j54]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): 40-48 (2015) - [j53]Philipp Hungerländer, Franz Rendl:
A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds. SIAM J. Optim. 25(3): 1633-1659 (2015) - 2014
- [j52]Christoph Helmberg, Michael L. Overton, Franz Rendl:
The spectral bundle method with second-order information. Optim. Methods Softw. 29(4): 855-876 (2014) - [e2]Christian Pötzsche, Clemens Heuberger, Barbara Kaltenbacher, Franz Rendl:
System Modeling and Optimization - 26th IFIP TC 7 Conference, CSMO 2013, Klagenfurt, Austria, September 9-13, 2013, Revised Selected Papers. IFIP Advances in Information and Communication Technology 443, Springer 2014, ISBN 978-3-662-45503-6 [contents] - 2013
- [j51]Philipp Hungerländer, Franz Rendl:
A computational study and survey of methods for the single-row facility layout problem. Comput. Optim. Appl. 55(1): 1-20 (2013) - [j50]Philipp Hungerländer, Franz Rendl:
Semidefinite relaxations of ordering problems. Math. Program. 140(1): 77-97 (2013) - 2012
- [j49]Franz Rendl:
Semidefinite relaxations for partitioning, assignment and ordering problems. 4OR 10(4): 321-346 (2012) - 2011
- [j48]Miguel F. Anjos, Etienne de Klerk, Franz Rendl:
Preface. Math. Program. 129(1): 1-3 (2011) - [j47]Immanuel M. Bomze, Florian Jarre, Franz Rendl:
Quadratic factorization heuristics for copositive programming. Math. Program. Comput. 3(1): 37-57 (2011) - 2010
- [j46]Igor Dukanovic, Franz Rendl:
Copositive programming motivated bounds on the stability and the chromatic numbers. Math. Program. 121(2): 249-268 (2010) - [j45]Franz Rendl, Giovanni Rinaldi, Angelika Wiegele:
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121(2): 307-335 (2010) - [p1]Franz Rendl:
Semidefinite Relaxations for Integer Programming. 50 Years of Integer Programming 2010: 687-726
2000 – 2009
- 2009
- [j44]Janez Povh, Franz Rendl:
Copositive and semidefinite relaxations of the quadratic assignment problem. Discret. Optim. 6(3): 231-241 (2009) - [j43]Jérôme Malick, Janez Povh, Franz Rendl, Angelika Wiegele:
Regularization Methods for Semidefinite Programming. SIAM J. Optim. 20(1): 336-356 (2009) - 2008
- [j42]Igor Dukanovic, Franz Rendl:
A semidefinite programming-based heuristic for graph coloring. Discret. Appl. Math. 156(2): 180-189 (2008) - [j41]Florian Jarre, Franz Rendl:
An Augmented Primal-Dual Method for Linear Conic Programs. SIAM J. Optim. 19(2): 808-823 (2008) - 2007
- [j40]Igor Dukanovic, Franz Rendl:
Semidefinite programming relaxations for graph coloring and maximal clique problems. Math. Program. 109(2-3): 345-365 (2007) - [j39]Franz Rendl, Renata Sotirov:
Bounds for the quadratic assignment problem using the bundle method. Math. Program. 109(2-3): 505-524 (2007) - [j38]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) - [j37]Janez Povh, Franz Rendl:
A Copositive Programming Approach to Graph Partitioning. SIAM J. Optim. 18(1): 223-241 (2007) - [c10]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
- [j36]Janez Povh, Franz Rendl, Angelika Wiegele:
A Boundary Point Method to Solve Semidefinite Programs. Computing 78(3): 277-286 (2006) - [j35]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
- [j34]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
- [j33]Abdel Lisser, Franz Rendl:
Graph partitioning using linear and semidefinite programming. Math. Program. 95(1): 91-101 (2003) - [j32]Gerald Gruber, Franz Rendl:
Computational Experience with Stable Set Relaxations. SIAM J. Optim. 13(4): 1014-1028 (2003) - [j31]Karl Kunisch, Franz Rendl:
An Infeasible Active Set Method for Quadratic Problems with Simple Bounds. SIAM J. Optim. 14(1): 35-52 (2003) - [e1]Ulrike Leopold-Wildburger, Franz Rendl, Gerhard Wäscher:
Operations Research Proceedings 2002, Selected Papers of the International Conference on Operations Research (SOR 2002), Klagenfurt, Austria, September 2-5, 2002. Springer 2003, ISBN 978-3-540-00387-8 [contents] - 2002
- [j30]Gerald Gruber, Franz Rendl:
Computational Experience with Ill-Posed Problems in Semidefinite Programming. Comput. Optim. Appl. 21(2): 201-212 (2002) - [j29]Charles H. C. Little, Franz Rendl, Ilse Fischer:
Towards a characterisation of Pfaffian near bipartite graphs. Discret. Math. 244(1-3): 279-297 (2002) - 2001
- [c9]Gerald Gruber, Franz Rendl:
The Bundle Method for Hard Combinatorial Optimization Problems. Combinatorial Optimization 2001: 78-88 - 2000
- [j28]Stefan E. Karisch, Franz Rendl, Jens Clausen:
Solving Graph Bisection Problems with Semidefinite Programming. INFORMS J. Comput. 12(3): 177-191 (2000) - [j27]Christoph Helmberg, Franz Rendl, Robert Weismantel:
A Semidefinite Programming Approach to the Quadratic Knapsack Problem. J. Comb. Optim. 4(2): 197-215 (2000) - [j26]Christoph Helmberg, Franz Rendl:
A Spectral Bundle Method for Semidefinite Programming. SIAM J. Optim. 10(3): 673-696 (2000)
1990 – 1999
- 1999
- [j25]Michel X. Goemans, Franz Rendl:
Semidefinite Programs and Association Schemes. Computing 63(4): 331-340 (1999) - 1998
- [j24]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): 127-147 (1998) - [j23]Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger:
The Stock Size Problem. Oper. Res. 46(3-Supplement-3): S1-S12 (1998) - [j22]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) - [c8]Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl:
Incorporating Inequality Constraints in the Spectral Bundle Method. IPCO 1998: 423-436 - 1997
- [j21]Rainer E. Burkard, Stefan E. Karisch, Franz Rendl:
QAPLIB - A Quadratic Assignment Problem Library. J. Glob. Optim. 10(4): 391-403 (1997) - [j20]Monique Laurent, Svatopluk Poljak, Franz Rendl:
Connections between semidefinite relaxations of the max-cut and stable set problems. Math. Program. 77: 225-246 (1997) - [j19]Franz Rendl, Henry Wolkowicz:
A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Program. 77: 273-299 (1997) - 1996
- [j18]Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz:
An Interior-Point Method for Semidefinite Programming. SIAM J. Optim. 6(2): 342-361 (1996) - [c7]Christoph Helmberg, Franz Rendl, Robert Weismantel:
Quadratic Knapsack Relaxations Using Cutting Planes. IPCO 1996: 175-189 - 1995
- [j17]Franz Rendl, Henry Wolkowicz:
A projection technique for partitioning the nodes of a graph. Ann. Oper. Res. 58(3): 155-179 (1995) - [j16]Svatopluk Poljak, Franz Rendl:
Solving the Max-cut Problem Using Eigenvalues. Discret. Appl. Math. 62(1-3): 249-278 (1995) - [j15]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): 51-73 (1995) - [j14]Franz Rendl:
Book review. Math. Methods Oper. Res. 41(1): 56 (1995) - [j13]Stefan E. Karisch, Franz Rendl:
Lower bounds for the quadratic assignment problem via triangle decompositions. Math. Program. 71: 137-151 (1995) - [j12]Svatopluk Poljak, Franz Rendl:
Nonpolyhedral Relaxations of Graph-Bisection Problems. SIAM J. Optim. 5(3): 467-487 (1995) - [c6]Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz:
Combining Semidefinite and Polyhedral Relaxations for Integer Programs. IPCO 1995: 124-134 - 1994
- [j11]Svatopluk Poljak, Franz Rendl:
Node and edge relaxations of the Max-cut problem. Computing 52(2): 123-137 (1994) - [j10]Julie Falkner, Franz Rendl, Henry Wolkowicz:
A computational study of graph partitioning. Math. Program. 66: 211-239 (1994) - 1993
- [j9]Franz Rendl, Gerhard J. Woeginger:
Reconstructing sets of orthogonal line segments in the plane. Discret. Math. 119(1-3): 167-174 (1993) - [c5]Panos M. Pardalos, Franz Rendl, Henry Wolkowicz:
The Quadratic Assignment Problem: A Survey and Recent Developments. Quadratic Assignment and Related Problems 1993: 1-42 - [c4]Stefan E. Karisch, Franz Rendl, Henry Wolkowicz:
Trust Regions and Relaxations for the Quadratic Assignment Problem. Quadratic Assignment and Related Problems 1993: 199-219 - [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
- [j8]Scott W. Hadley, Franz Rendl, Henry Wolkowicz:
A New Lower Bound Via Projection for the Quadratic Assignment Problem. Math. Oper. Res. 17(3): 727-739 (1992) - [j7]Franz Rendl, Henry Wolkowicz:
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Math. Program. 53: 63-78 (1992) - 1991
- [j6]Horst W. Hamacher, Franz Rendl:
Color constrained combinatorial optimization problems. Oper. Res. Lett. 10(4): 211-219 (1991) - [j5]Rainer E. Burkard, Franz Rendl:
Lexicographic bottleneck problems. Oper. Res. Lett. 10(5): 303-308 (1991) - 1990
- [j4]Matthias Leclerc, Franz Rendl:
k-Best constrained bases of a matroid. ZOR Methods Model. Oper. Res. 34(2): 79-89 (1990) - [c1]Scott W. Hadley, Franz Rendl, Henry Wolkowicz:
Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques. IPCO 1990: 237-248
1980 – 1989
- 1989
- [j3]Franz Rendl, Matthias Leclerc:
A multiply constrained matroid optimization problem. Discret. Math. 73(1-2): 207-212 (1989) - 1986
- [j2]Franz Rendl:
Quadratic assignment problems on series-parallel digraphs. Z. Oper. Research 30(3) (1986) - 1985
- [j1]Franz Rendl:
Book reviews. Z. Oper. Research 29(7): 268 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
