Rendl Franz

Franz Rendl

Information about the author Franz Rendl will soon be added to the site.
Found 14 papers in total
A computational study and survey of methods for the single‐row facility layout problem
A computational study and survey of methods for the single‐row facility layout problem
2013
The single‐row facility layout problem (SRFLP) is an NP‐hard...
Solving graph bisection problems with semidefinite programming
Solving graph bisection problems with semidefinite programming
2000
An exact solution method for the graph bisection problem is presented. We describe a...
Solving quadratric (0,1)-problems by semidefinite programs and cutting planes
Solving quadratric (0,1)-problems by semidefinite programs and cutting planes
1998
We present computational experiments for solving quadratic (0, 1) problems. Our...
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...
The stock size problem
The stock size problem
1998
Consider a number of jobs that have to be completed within some fixed period of time....
Connections between semidefinite relaxations of the max-cut and stable set problems
Connections between semidefinite relaxations of the max-cut and stable set problems
1997
We describe links between a recently introduced semidefinite relaxation for the...
A semidefinite framework for trust region subproblems with applications to large scale minimization
A semidefinite framework for trust region subproblems with applications to large scale minimization
1997
Primal–dual pairs of semidefinite programs provide a general framework for the...
Lower bounds for the quadratic assignment problem via triangle decompositions
Lower bounds for the quadratic assignment problem via triangle decompositions
1995
The authors consider transformations of the (metric) Quadratic Assignment Problem...
A computational study of graph partitioning
A computational study of graph partitioning
1994
Let G=(N,E) be an edge-weighted undirected graph. The graph partitioning problem is...
A projection technique for partitioning the nodes of a graph
A projection technique for partitioning the nodes of a graph
1995
Let G=(N,E) be an undirected graph. The authors present several new techniques for...
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
1992
The authors investigate new bounding strategies based on different relaxations of the...
Color constrained combinatorial optimization problems
Color constrained combinatorial optimization problems
1991
The authors consider combinatorial optimization problems in which each feasible...
Lexicographic bottleneck problems
Lexicographic bottleneck problems
1991
The authors study combinatorial optimization problems with bottleneck objective...
Constrained spanning trees and the traveling salesman problem
Constrained spanning trees and the traveling salesman problem
1989
Minimum weight 1-trees provide a well-known lower bound for the symmetric traveling...
Papers per page: