335 results on '"Rendl, Franz"'
Search Results
2. Stable-Set and Coloring bounds based on 0-1 quadratic optimization
3. A Computational Study of Exact Subgraph Based SDP Bounds for Max-Cut, Stable Set and Coloring
4. Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs
5. Lower Bounds for the Bandwidth Problem
6. A Bundle Approach for SDPs with Exact Subgraph Constraints
7. In memoriam Gerhard Woeginger
8. Regularization of inverse problems via box constrained minimization
9. Using a Factored Dual in Augmented Lagrangian Methods for Semidefinite Programming
10. Lower bounds for the bandwidth problem
11. Computing quasisolutions of nonlinear inverse problems via efficient minimization of trust region problems
12. Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems
13. Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016
14. Towards a characterisation of Pfaffian graphs
15. A Bundle Approach for SDPs with Exact Subgraph Constraints
16. STABLE-SET AND COLORING BOUNDS BASED ON 0-1 QUADRATIC OPTIMIZATION.
17. Bandwidth, Vertex Separators, and Eigenvalue Optimization
18. Computational Approaches to Max-Cut
19. Matrix Relaxations in Combinatorial Optimization
20. In memoriam Gerhard Woeginger
21. Semidefinite Relaxations for Integer Programming
22. A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
23. The Bundle Method for Hard Combinatorial Optimization Problems
24. Combinatorial Optimization
25. Approximating Stable Sets Using the ϑ-function and Cutting Planes
26. Replicator Dynamics for Evolution Towards the Maximum Clique: Variations and Experiments
27. Incorporating Inequality Constraints in the Spectral Bundle Method
28. Quantum Annealing versus Digital Computing
29. Copositive and semidefinite relaxations of the quadratic assignment problem
30. A computational study and survey of methods for the single-row facility layout problem
31. The Stock Size Problem
32. The merger of populations, the incidence of marriages, and aggregate unhappiness
33. Quadratic factorization heuristics for copositive programming
34. Copositive programming motivated bounds on the stability and the chromatic numbers
35. Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
36. Bounds for the quadratic assignment problem using the bundle method
37. Semidefinite programming relaxations for graph coloring and maximal clique problems
38. Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition
39. Bandwidth, Vertex Separators, and Eigenvalue Optimization
40. Matrix Relaxations in Combinatorial Optimization
41. Computational Approaches to Max-Cut
42. Computational Experience with Ill-Posed Problems in Semidefinite Programming
43. Semidefinite Relaxations for Integer Programming
44. Preface
45. A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring
46. Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
47. On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel
48. Semidefinite Programming Relaxations for the Quadratic Assignment Problem
49. Semidefinite Programming and Integer Programming
50. QAPLIB – A Quadratic Assignment Problem Library
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.