#### Filter Results:

- Full text PDF available (53)

#### Publication Year

1985

2018

- This year (2)
- Last 5 years (6)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Rainer E. Burkard, Stefan E. Karisch, Franz Rendl
- J. Global Optimization
- 1997

The Quadratic Assignment Problem (QAP) has remained one of the great challenges in combinatorial optimization. It is still considered a computationally nontrivial task to solve modest size problems,â€¦ (More)

- Panos M. Pardalos, Franz Rendl, Henry Wolkowicz
- Quadratic Assignment and Related Problems
- 1993

Quadratic Assignment Problems model many applications in diverse areas such as operations research, parallel and distributed computing , and combinatorial data analysis. In this paper we survey someâ€¦ (More)

- Christoph Helmberg, Franz Rendl
- SIAM Journal on Optimization
- 2000

A central drawback of primal-dual interior point methods for semidefinite programs is their lack of ability to exploit problem structure in cost and coefficient matrices. This restricts applicabilityâ€¦ (More)

- Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz
- SIAM Journal on Optimization
- 1996

We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semidefinite matrices.â€¦ (More)

- Franz Rendl
- Zeitschr. fÃ¼r OR
- 1986

- Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry Wolkowicz
- J. Comb. Optim.
- 1998

Semideenite programming(SDP) relaxations for the quadratic assignment problem (QAP) are derived using the dual of the (homogenized) Lagrangian dual of appropriate equivalent representations of QAP.â€¦ (More)

- Franz Rendl, Henry Wolkowicz
- Math. Program.
- 1997

Primal-dual pairs of semidefinite programs provide a general framework for the theory and algorithms for the trust region subproblem (TRS), This latter problem consists in minimizing a generalâ€¦ (More)

- Franz Rendl, Giovanni Rinaldi, Angelika Wiegele
- Math. Program.
- 2010

In this paper we present a method for finding exact solutions of MaxCut, the problem of finding a cut of maximum weight in a weighted graph. We use a Branch-and-Bound setting, that applies a dynamicâ€¦ (More)

- Franz Rendl, Henry Wolkowicz
- Annals OR
- 1995

Let G = (N, E) be an undirected graph with node set N = { 1 ..... n }, edge set E and edge weights {c(e) : e ~ E}. (If the graph is unweighted, then we assume c(e) = 1 for e E E.) A common problem inâ€¦ (More)

- Svatopluk Poljak, Franz Rendl, Henry Wolkowicz
- J. Global Optimization
- 1995

We review various relaxations of (0,1)-quadratic programming problems. These include semidefinite programs, parametric trust region problems and concave quadratic maximization. All relaxations thatâ€¦ (More)