18 results on '"Rendl, Franz"'
Search Results
2. Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
3. Bounds for the quadratic assignment problem using the bundle method
4. Semidefinite programming relaxations for graph coloring and maximal clique problems
5. Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition
6. A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring
7. Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
8. Connections between semidefinite relaxations of the max-cut and stable set problems
9. A semidefinite framework for trust region subproblems with applications to large scale minimization
10. Lower bounds for the quadratic assignment problem via triangle decompositions
11. A computational study of graph partitioning
12. Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
13. Preface
14. Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
15. Copositive programming motivated bounds on the stability and the chromatic numbers
16. Semidefinite programming relaxations for graph coloring and maximal clique problems
17. Bounds for the quadratic assignment problem using the bundle method
18. Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.