Professoren
Univ.-Prof. Dipl.-Ing. Dr. Franz Rendl

Univ.-Prof. Dipl.-Ing. Dr. Franz Rendl

Originalbeitrag in Sammelwerk

Rendl F.: Semidefinite Relaxations for Integer Programming. In: M. Jünger, Th. M. Liebling, D. Naddef,
G. L. Nemhauser, W. R. Pulleyblank, G. Reinelt, G. Rinaldi, L. A. Wolsey (Hrsg.): 50 Years of Integer Programming 1958-2008. Berlin, Heidelberg, New York: Springer Verlag GmbH, 2009, pp. 687-726.

Rendl F., Rinaldi G., Wiegele A.: A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. In: M. Fischetti, D. Williamson. (Hrsg.): Integer Programming and Combinatorial Optimization. Berlin/Heidelberg: Springer, Juni 2007 (Lecture Notes in Computer Science, 4513), pp. 295-309.

Rendl F., Sotirov R.: Bounds for the Quadratic Assignment Problem Using the Bundle Method. In: U. Derigs, H.W. Hamacher, U. Zimmermann. (Hrsg.): Discrete Optimization: Methods and Applications. Köln: Eigenverlag, 2003, pp. 287-306.

Rendl F.: The Quadratic Assignment Problem. In: Z. Drezner, H.W. Hamacher. (Hrsg.): Facility Location: Applications and Theory. Berlin [u.a.]: Springer, 2002, pp. 439-457.

Rendl F., Sotirov R.: The Bundle Method Applied to QAP. In: L. Lenart, L. Zadnik Stirn, S. Drobne. (Hrsg.): 6th International Symposium on Operational Research SOR '01, Preddvor, Slovenia, September 26-28, 2001. Proceedings. Ljubljana: Slovenian Society Informatika, Section for Operational Research, 2001, pp. 95-101.

Goemans M. X., Rendl F.: Combinatorial Optimization. In: H. Wolkowicz, R. Saigal, L. Vandenberghe. (Hrsg.): Handbook of Semidefinite Programming: Theory, Algorithms, and Applications. Boston, MA: Kluwer Acad. Publ, 2000 (Internat. Ser. Oper. Res. Management Sci, 27), pp. 343-360.

Gruber G., Rendl F.: Approximating stable sets using the theta-function and cutting planes. In: L. Lenart, L. Zadnik Stirn, S. Drobne. (Hrsg.): 5th International Symposium on Operational Research SOR '99, Preddvor, Slovenia, September 30 - October 2, 1999. Proceedings. Ljubljana: Slovenian Society Informatika, Section for Operational Research, 2000, pp. 69-74.

Bomze I., Rendl F.: Replicator dynamics for evolution towards the maximum clique: variations and experiments. In: R. De Leone, A. Murli, P.M. Pardalos, G. Toraldo. (Hrsg.): High performance algorithms and software in nonlinear optimization (Ischia, 1997). Dordrecht: Kluwer Acad. Publ, 1998 (Appl. Optim, 24), pp. 53-67.

Helmberg C., Kiwiel K.C., Rendl F.: Incorporating inequality constraints in the spectral bundle method. In: R.E. Bixby, E.A. Boyd, R.Z. Rios-Mercado. (Hrsg.): Integer Programming and Combinatorial Optimization (Houston, TX, 1998). Berlin: Springer, 1998 (Lecture Notes in Comput. Sci, 1412), pp. 423-435.

Karisch S.E., Rendl F.: Semidefinite programming and graph equipartition. In: Topics in semidefinite and interior-point methods (Toronto, ON, 1996). Providence, RI: Amer. Math. Soc, 1998 (Fields Institute Communications, 18), pp. 77-95.

Helmberg C., Kiwiel K.C., Rendl F.: Incorporating inequality constraints in the spectral bundle method. In: R.E. Bixby, E.A. Boyd, R.Z. Rios-Mercado. (Hrsg.): Integer Programming and Combinatorial Optimization. Berlin: Springer, 1997 (Lecture Notes in Comput. Sci, 1284), pp. 259-270.

Helmberg C., Rendl F., Weismantel R.: Quadratic knapsack relaxations using cutting planes and semidefinite programming. In: Integer programming and combinatorial optimization (Vancouver, BC, 1996). Berlin: Springer, 1996 (Lecture Notes in Comput. Sci, 1084), pp. 175-189.

Helmberg C., Poljak S., Rendl F., Wolkowicz H.: Combining semidefinite and polyhedral relaxations for integer programs. In: Integer programming and combinatorial optimization (Copenhagen, 1995). Berlin: Springer, 1995 (Lecture Notes in Computer Science, 920), pp. 124-134.

Karisch S.E., Rendl F., Wolkowicz H.: Trust regions and relaxations for the Quadratic Assignment Problem. In: Quadratic assignment and related problems (New Brunswick, NJ, 1993). Providence, RI: Amer. Math. Soc, 1994 (DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16), pp. 199-219.

Pardalos P.M., Rendl F., Wolkowicz H.: The Quadratic Assignment Problem: A Survey and recent developments. In: Quadratic assignment and related problems (New Brunswick, NJ, 1993). Providence, RI: Amer. Math. Soc, 1994 (DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16), pp. 1-42.

Hadley S.W., Rendl F., Wolkowicz H.: Bounds for the Quadratic Assignment Problem using continuous optimization techniques. In: R. Kannan, W.R. Pulleyblank. (Hrsg.): Integer Programming and Combinatorial Optimization (IPCO). Waterloo, 1990, pp. 237-248.


Originalbeitrag in Zeitschrift

Dukanovic I., Rendl F.: Copositive programming motivated bounds on the stability and the chromatic numbers. In: Mathematical Programming, Berlin, Heidelberg, New York: Springer Verlag GmbH, 121 (2010), 2, 249-268.

Rendl F., Rinaldi G., Wiegele A.: Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. In: Mathematical Programming, Berlin, Heidelberg, New York: Springer Verlag GmbH, 121 (2010), 2, pp. 307-335.

Malick J., Povh J., Rendl F., Wiegele A.: Regularization Methods for Semidefinite Programming. In: SIAM Journal on Optimization, Philadelphia (PA): Society for Industrial and Applied Mathematics (SIAM), 20 (2009), 1, pp. 336-356.

Jarre F., Rendl F.: An Augmented Primal-Dual Method for Linear Conic Programs. In: SIAM Journal on Optimization, Philadelphia (PA): Society for Industrial and Applied Mathematics (SIAM), 19 (2008), 2, pp. 808-823.

Dukanovic I., Rendl F.: Semidefinite programming relaxations for graph coloring and maximal clique problems. In: Mathematical Programming, Serie B, Berlin, Heidelberg, New York: Springer Verlag GmbH, 109 (2007), pp. 345-365.

Povh J., Rendl F.: A copositive programming approach to graph partitioning. In: SIAM Journal on Optimization, Philadelphia (PA): Society for Industrial and Applied Mathematics (SIAM), 18 (2007), 1, pp. 223-241.

Rendl F., Sotirov R.: Bounds for the quadratic assignment problem using the bundle method. In: Mathematical Programming, Serie B, 109 (2007), pp. 505-524.

Rendl F.: A copositive programming approach to graph partitioning. In: SIAM Journal on Optimization, 18 (2007), 1, pp. 223-241.

Dukanovic I., Rendl F.: Semidefinite programming relaxations for graph coloring and maximal clique problems. In: Mathematical Programming, Serie B, 109 (2007), pp. 345-365.

Povh J., Rendl F., Wiegele A.: A Boundary Point Method to solve Semidefinite Programs. In: Computing, 78 (2006), 3, 277-286.

Fischer I., Gruber G., Rendl F., Sotirov R.: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition. In: Mathematical Programming, Serie B, vol.105 (2006), pp. 451-469.

Fung H. K., Rao S., Floudas C. A., Prokopyev O., Pardalos P.M., Rendl F.: Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design. In: Journal of Combinatorial Optimization, Volume 10 (2005), 1, pp. 41-60.

Lisser A., Rendl F.: Graph partitioning using linear and semidefinite programming. In: Mathematical Programming (Series B), Vol. 95 (2003), No. 1, pp. 91-102.

Gruber G., Rendl F.: Computational experience with stable set relaxations. In: SIAM Journal on Optimization, 13 (2003), 4, pp. 1014-1028.

Kunisch K., Rendl F.: An infeasible active set method for quadratic problems with simple bounds. In: SIAM Journal on Optimization, 14 (2003), 1, pp. 35-52.

Gruber G., Rendl F.: Computational Experience with ill-posed problems in Semidefinite Programming. In: Computational Optimization and Application, Vol. 21 (2002), No. 2, pp. 201-212.

Little C. H. C., Rendl F., Fischer I.: Towards a characterisation of Pfaffian near bipartite graphs. In: Discrete Mathematics, Vol. 244 (2002), No. 1-3, pp. 279-297.

Kruk S., Muramatsu M., Rendl F., Vanderbei R.J., Wolkowicz H.: The Gauss-Newton direction in semidefinite programming. In: Optimization Methods and Software (OMS), Vol. 15 (2001), No. 1, pp. 1-28.

Helmberg C., Rendl F.: A Spectral Bundle Method for Semidefinite Programming. In: SIAM Journal on Optimization, Vol. 10 (2000), No. 3, pp. 673-696.

Helmberg C., Rendl F., Weismantel R.: A Semidefinite Programming Approach to the Quadratic Knapsack Problem. In: Journal of Combinatorial Optimization, Vol. 4 (2000), No. 2, pp. 197-215.

Karisch S.E., Rendl F., Clausen J.: Solving Graph Bisection Problems with Semidefinite Programming. In: INFORMS Journal on Computing, Vol. 12 (2000), No. 3, pp. 177-191.

Goemans M.X., Rendl F.: Semidefinite Programs and Association Schemes. In: Computing, Vol. 63 (1999), No. 4, pp. 331-340.

Goemans M.X., Rendl F.: Semidefinite Programs and Association Schemes. In: Computing, Vol. 63 (1999), pp. 331-340.

Rendl F.: Semidefinite Programming and Combinatorial Optimization. In: Applied Numerical Mathematics, Vol. 29 (1999), No. 3, pp. 255-281.

Clausen J., Karisch S.E., Perregaard M., Rendl F.: On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel. In: Computational Optimization and Applications, Vol. 10 (1998), No. 2, pp. 127-147.

Helmberg C., Rendl F.: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. In: Mathematical Programming (Series A), Vol. 82 (1998), No. 3, pp. 291-315.

Karisch S.E., Rendl F., Wolkowicz H., Zhao Q.: Semidefinite Programming Relaxations for the Quadratic Assignment Problem. In: Journal of Combinatorial Optimization, Vol. 2 (1998), No. 1, pp. 71- 109.

Kellerer H., Kotov V., Rendl F., Wöginger G.: The Stock Size Problem. In: Operations Research, Vol. 46 (1998), pp. S1-S12.

Burkard R.E., Rendl F.: QAPLIB - a quadratic assignment problem library. In: J. Global Optim, Vol. 10 (1997), No. 4, pp. 391-403.

Laurent M., Poljak S., Rendl F.: Connections between semidefinite relaxations of the max-cut and stable set problems. In: Mathematical Programming (Series B), Vol. 77 (1997), No. 2, pp. 225-246.

Rendl F., Wolkowicz H.: A semidefinite framework for trust region subproblems with applications to large scale minimization. In: Mathematical Programming (Series B), Vol. 77 (1997), No. 2, pp. 273-299.

Helmberg C., Rendl F., Vanderbei R.J., Wolkowicz H.: An Interior-Point Method for Semidefinite Programming. In: SIAM Journal on Optimization, Vol. 6 (1996), No. 2, pp. 342-361.

Helmberg C., Mohar B., Poljak S., Rendl F.: A spectral approach to Bandwidth and Separator Problems in Graphs. In: Linear and Multilinear Algebra, Vol. 39 (1995), No. 1-2, pp. 73-90.

Karisch S.E., Rendl F.: Lower bounds for the quadratic assignment problem via triangle decompositions. In: Mathematical Programming (Series A), Vol. 71 (1995), No. 2, pp. 137-151.

Poljak S., Rendl F.: Nonpolyhedral Relaxations of Graph-Bisection Problems. In: SIAM Journal on Optimization, Vol. 5 (1995), No. 3, pp. 467-487.

Poljak S., Rendl F.: Solving the max-cut problem using eigenvalues. In: Discrete Applied Mathematics, Vol. 62 (1995), No. 1-3, pp. 249-278.

Poljak S., Rendl F., Wolkowicz H.: A recipe for semidefinite relaxation for (0,1)-quadratic programming. In: Journal of Global Optimization, Vol. 7 (1995), No. 1, pp. 51-73.

Rendl F., Vanderbei R.J., Wolkowicz H.: Max-min Eigenvalue problems, primal-dual interior point algorithms, and Trust Region subproblems. In: Optimization Methods and Software, Vol. 5 (1995), pp. 1-16.

Rendl F., Wolkowicz H.: A projection technique for partitioning the nodes of a graph. In: Annals of Operations Research, Vol. 58 (1995), pp. 155-179.

Falkner J., Rendl F., Wolkowicz H.: A computational study of Graph Partitioning. In: Mathematical Programming (Series A), Vol. 66 (1994), No. 2, pp. 211-239.

Poljak S., Rendl F.: Node and edge relaxations of the max-cut problem. In: Computing, Vol. 52 (1994), No. 2, pp. 123-137.

Rendl F., Wöginger G.: Reconstructing sets of orthogonal line segments in the plane. In: Discrete Mathematics, Vol. 119 (1993), No. 1-3, pp. 167-174.

Hadley S.W., Rendl F., Wolkowicz H.: Symmetrization of Nonsymmetric Quadratic Assignment Problems and the Hoffman-Wielandt Inequality. In: Linear Algebra and its Applications, Vol. 167 (1992), pp. 53-64.

Hadley S.W., Rendl F., Wolkowicz H.: A new lower bound via projection for the quadratic assignment problem. In: Mathematics of Operations Research, Vol. 17 (1992), No. 3, pp. 727-739.

Rendl F., Wolkowicz H.: Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. In: Mathematical Programming (Series A), Vol. 53 (1992), No. 1, pp. 63- 78.

Burkard R.E., Rendl F.: Lexicographic bottleneck problems. In: Operations Research Letters, Vol. 10 (1991), No. 5, pp. 303-308.

Hamacher H.W., Rendl F.: Color constrained combinatorial optimization problems. In: Operations Research Letters, Vol. 10 (1991), No. 4, pp. 211-219.

Little C.H.C., Rendl F.: Operations preserving the Pfaffian property of a graph. In: Journal of the Australian Mathematical Society (Series A), Vol. 50 (1991), No. 2, pp. 248-257.

Leclerc M., Rendl F.: K-best constrained bases of a matroid. In: Zeitschrift für Operations Research, Vol. 34 (1990), No. 2, pp. 79-89.

Leclerc M., Rendl F.: A multiply constrained matroid optimization problem. In: Discrete Mathematics, Vol. 73 (1989), No. 1-2, pp. 207-212.

Leclerc M., Rendl F.: Constrained spanning trees and the travelling salesman problem. In: European Journal of Operational Research, Vol. 39 (1989), No. 1, pp. 96-102.

Little C.H.C., Rendl F.: An algorithm for the Ear decomposition of a 1-factor covered graph. In: Journal of the Australian Mathematical Society (Series A), Vol. 46 (1989), No. 2, pp. 296-301.

Rendl F.: On the Euclidean assignment problem. In: Journal of Computational and Applied Mathematics, Vol. 23 (1988), No. 3, pp. 257-265.

Burkard R.E., Finke G., Rendl F.: Quadratic assignment problems. In: Annals of Discrete Mathematics, Vol. 31 (1987), pp. 61-82.

Rendl F.: Quadratic assignment problems on series-parallel digraphs. In: Zeitschrift für Operations Research (Series A-B), Vol. 30 (1986), No. 3, pp. A161-A173.

Rendl F., Rote G.: Minimizing the density of terminal assignments in layout design. In: Operations Research Letters, Vol. 5 (1986), No. 3, pp. 111-118.

Rendl F.: Ranking scalar products to improve bounds for the quadratic assignment problem. In: European Journal of Operational Research, Vol. 20 (1985), No. 3, pp. 363-372.

Rendl F.: On the complexity of decomposing matrices arising in satellite communication. In: Operations Research Letters, Vol. 4 (1985), pp. 5-8.

Burkard R.E., Rendl F.: A thermodynamically motivated simulation procedure for combinatorial optimization problems. In: European Journal of Operational Research, Vol. 17 (1984), pp. 169-174.

Rendl F., Sturm F.: Ein Prediktor-Korrektor Verfahren zur Berechnung von Kriechdehnungen. In: Zeitschrift für Angewandte Mathematik und Mechanik, Jg. 63 (1983), S. 505-511.

Kurnisch K., Rendl F.: An infeasible acture set method for cource problems with simple bounds. In: SIAM Journal on Optimization, 14/2003 (0000), 1, pp. 35-52.


Herausgeberschaft von Zeitschrift/Sammelwerk/Reihe

Leopold-Wildburger U., Rendl F., Wäscher G. (Hrsg.): Operations Research Proceedings 2002. Berlin - Heidelberg: Springer, 2003, pp. 550.


Sonstige wiss. Publikation (selbstständig)

Rendl F.: Das Quadratische Zuordnungsproblem: Spezialfälle, Näherungsverfahren und untere Schranken. TU Graz, 1988.

Nutzungshinweise: Jede natürliche Person darf sich nur mit einer E-Mail Adresse bei WiWi-Online registrieren lassen. Die Nutzung der Daten die WiWi-Online bereitstellt ist nur für den privaten Gebrauch bestimmt - eine gewerbliche Nutzung ist verboten. Eine automatisierte Nutzung von WiWi-Online und dessen Inhalte, z.B. durch Offline-Browser, Download-Manager oder Webseiten etc. ist ausdrücklich strengstens untersagt. Zuwiderhandlungen werden straf- und zivilrechtlich verfolgt.