The following pages link to Marianna. E.-Nagy (Q296966):
Displaying 12 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- (Q644910) (redirect page) (← links)
- On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
- (Q740646) (redirect page) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- Expected Lifetime and Capacity (Q2808826) (← links)
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation (Q6166934) (← links)
- Mixed integer linear programming formulation for K-means clustering problem (Q6536475) (← links)
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems (Q6596329) (← links)
- Sufficient matrices: properties, generating and testing (Q6596334) (← links)
