Pages that link to "Item:Q5050143"
From MaRDI portal
The following pages link to Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143):
Displaying 10 items.
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Introduction to QUBO (Q5050141) (← links)
- Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
- The Random QUBO (Q5050147) (← links)
- Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- QUBO Software (Q5050151) (← links)
- The rotation distance of brooms (Q6201876) (← links)
- QUBO formulation for aircraft load optimization (Q6639950) (← links)