Pages that link to "Item:Q2897308"
From MaRDI portal
The following pages link to Matrix Relaxations in Combinatorial Optimization (Q2897308):
Displaying 8 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Computing the maximum degree of minors in matrix pencils via combinatorial relaxation (Q1402222) (← links)
- Improving ADMMs for solving doubly nonnegative programs through dual factorization (Q2240675) (← links)
- The SAT+CAS method for combinatorial search with applications to best matrices (Q2294574) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
- McCormick-Based Relaxations of Algorithms (Q3563896) (← links)
- Optimization problems involving matrix multiplication with applications in materials science and biology (Q6094500) (← links)