Rendl F.

F. Rendl

Information about the author F. Rendl will soon be added to the site.
Found 5 papers in total
Graph partitioning using linear and semidefinite programming
Graph partitioning using linear and semidefinite programming
2003
Graph partition is used in the telecommunication industry to subdivide a transmission...
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
1998
The quadratic assignment problem (QAP) belongs to the hard core of NP-hard...
A new lower bound via projection for the quadratic assignment problem
A new lower bound via projection for the quadratic assignment problem
1992
New lower bounds for the quadratic assignment problem QAP are presented. These bounds...
k-Best constrained bases of a matroid
k-Best constrained bases of a matroid
1990
The authors propose a method for finding a set of k- best bases of an arbitrary...
A multiply constrained matroid optimization problem
A multiply constrained matroid optimization problem
1988
The authors consider the problem of finding a minimum weight basis in a matroid...
Papers per page: