Pages that link to "Item:Q1756793"
From MaRDI portal
The following pages link to Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793):
Displaying 4 items.
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- Algorithm 996 (Q4960955) (← links)
- A Newton-bracketing method for a simple conic optimization problem (Q4999334) (← links)
- Comparing QUBO models for quantum annealing: integer encodings for permutation problems (Q6609696) (← links)