The following pages link to Franz Rendl (Q240162):
Displaying 50 items.
- Computing quasisolutions of nonlinear inverse problems via efficient minimization of trust region problems (Q318179) (← links)
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- Minimizing the density of terminal assignments in layout design (Q581242) (← links)
- Reconstructing sets of orthogonal line segments in the plane (Q688265) (← links)
- (Q794924) (redirect page) (← links)
- A thermodynamically motivated simulation procedure for combinatorial optimization problems (Q794925) (← links)
- QAPLIB-A quadratic assignment problem library (Q807376) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- A boundary point method to solve semidefinite programs (Q858180) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- On the Euclidean assignment problem (Q1108932) (← links)
- Color constrained combinatorial optimization problems (Q1178732) (← links)
- Lexicographic bottleneck problems (Q1180835) (← links)
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem (Q1184337) (← links)
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality (Q1187508) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- A computational study of graph partitioning (Q1340061) (← links)
- Towards a characterisation of Pfaffian near bipartite graphs (Q1349098) (← links)
- QAPLIB - a quadratic assignment problem library (Q1361076) (← links)
- Connection between semidefinite relaxations of the max-cut and stable set problems (Q1373736) (← links)
- A semidefinite framework for trust region subproblems with applications to large scale minimization (Q1373738) (← links)
- Semidefinite programming relaxations for the quadratic assignment problem (Q1386486) (← links)
- Graph partitioning using linear and semidefinite programming (Q1411631) (← links)
- A semidefinite programming approach to the quadratic knapsack problem (Q1583699) (← links)
- Constrained spanning trees and the traveling salesman problem (Q1823163) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071) (← links)
- Semidefinite programs and association schemes (Q1969297) (← links)
- In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
- In memoriam Gerhard Woeginger (1964--2022) (Q2157912) (← links)
- Regularization of inverse problems via box constrained minimization (Q2188146) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- A bundle approach for SDPs with exact subgraph constraints (Q2293089) (← links)
- Using a factored dual in augmented Lagrangian methods for semidefinite programming (Q2294228) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- (Q2712302) (← links)
- The Stock Size Problem (Q2781118) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Bandwidth, Vertex Separators, and Eigenvalue Optimization (Q2849002) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- The spectral bundle method with second-order information (Q2926057) (← links)
