Franz Rendl Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIgor Dukanovic, Franz Rendl: A semidefinite programming-based heuristic for graph coloring. Discrete Applied Mathematics 156(2): 180-189 (2008)
2007
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFranz Rendl, Giovanni Rinaldi, Angelika Wiegele: A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. IPCO 2007: 295-309
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIgor Dukanovic, Franz Rendl: Semidefinite programming relaxations for graph coloring and maximal clique problems. Math. Program. 109(2-3): 345-365 (2007)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFranz Rendl, Renata Sotirov: Bounds for the quadratic assignment problem using the bundle method. Math. Program. 109(2-3): 505-524 (2007)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFranz 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)
2006
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlse 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)
2003
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. Lisser, Franz Rendl: Graph partitioning using linear and semidefinite programming. Math. Program. 95(1): 91-101 (2003)
2002
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCharles H. C. Little, Franz Rendl, Ilse Fischer: Towards a characterisation of Pfaffian near bipartite graphs. Discrete Mathematics 244(1-3): 279-297 (2002)
2001
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGerald Gruber, Franz Rendl: The Bundle Method for Hard Combinatorial Optimization Problems. Combinatorial Optimization 2001: 78-88
2000
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStefan E. Karisch, Franz Rendl, Jens Clausen: Solving Graph Bisection Problems with Semidefinite Programming. INFORMS Journal on Computing 12(3): 177-191 (2000)
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristoph Helmberg, Franz Rendl, Robert Weismantel: A Semidefinite Programming Approach to the Quadratic Knapsack Problem. J. Comb. Optim. 4(2): 197-215 (2000)
1999
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichel X. Goemans, Franz Rendl: Semidefinite Programs and Association Schemes. Computing 63(4): 331-340 (1999)
1998
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl: Incorporating Inequality Constraints in the Spectral Bundle Method. IPCO 1998: 423-436
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQing Zhao, Stefan E. Karisch, Franz Rendl, Henry Wolkowicz: Semidefinite Programming Relaxations for the Quadratic Assignment Problem. J. Comb. Optim. 2(1): 71-109 (1998)
1997
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMonique Laurent, Svatopluk Poljak, Franz Rendl: Connections between semidefinite relaxations of the max-cut and stable set problems. Math. Program. 77: 225-246 (1997)
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFranz Rendl, Henry Wolkowicz: A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Program. 77: 273-299 (1997)
1996
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristoph Helmberg, Franz Rendl, Robert Weismantel: Quadratic Knapsack Relaxations Using Cutting Planes. IPCO 1996: 175-189
1995
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz: Combining Semidefinite and Polyhedral Relaxations for Integer Programs. IPCO 1995: 124-134
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSvatopluk Poljak, Franz Rendl: Solving the Max-cut Problem Using Eigenvalues. Discrete Applied Mathematics 62(1-3): 249-278 (1995)
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStefan E. Karisch, Franz Rendl: Lower bounds for the quadratic assignment problem via triangle decompositions. Math. Program. 71: 137-151 (1995)
1994
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulie Falkner, Franz Rendl, Henry Wolkowicz: A computational study of graph partitioning. Math. Program. 66: 211-239 (1994)
1993
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans Kellerer, Franz Rendl, Gerhard J. Woeginger: Computing the optimum stock size. IPCO 1993: 147-159
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl: A spectral approach to bandwidth and separator problems in graphs. IPCO 1993: 183-194
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFranz Rendl, Gerhard J. Woeginger: Reconstructing sets of orthogonal line segments in the plane. Discrete Mathematics 119(1-3): 167-174 (1993)
1992
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFranz Rendl, Henry Wolkowicz: Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Math. Program. 53: 63-78 (1992)
1990
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLScott W. Hadley, Franz Rendl, Henry Wolkowicz: Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques. IPCO 1990: 237-248

Coauthor Index

1Jens Clausen [17]
2Igor Dukanovic [24] [26]
3Julie Falkner [6]
4Ilse Fischer [19] [21]
5Michel X. Goemans [15]
6Gerald Gruber [18] [21]
7Scott W. Hadley [1]
8Christoph Helmberg [4] [9] [10] [14] [16]
9Stefan E. Karisch [7] [13] [17]
10Hans Kellerer [5]
11Krzysztof C. Kiwiel [14]
12Monique Laurent [12]
13A. Lisser [20]
14Charles H. C. Little (C. H. C. Little) [19]
15Bojan Mohar [4]
16Svatopluk Poljak [4] [8] [9] [12]
17Giovanni Rinaldi [25]
18Renata Sotirov [21] [23]
19Robert Weismantel [10] [16]
20Angelika Wiegele [25]
21Gerhard J. Woeginger [3] [5]
22Henry Wolkowicz [1] [2] [6] [9] [11] [13]
23Qing Zhao [13]

Colors in the list of coauthors

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)