Case Studies
This section provides examples of solving optimization, mathematical, and graph problems using QUBO++.
Math Problems
- Pythagorean Triples (Easy)
- Remainder Problem (Easy)
- Square Root (Medium)
- Greatest Common Divisor (GCD) (Easy)
- Math Problem: Find Three Integers (Easy)
- 3-Digit Math Problem (Easy)
- Cubic Equation (Easy)
Graph Problems
- Graph Drawing Library and MIS Problem (Easy)
- Max-Cut Problem (Easy)
- Maximum Matching Problem (Easy)
- Maximum Clique Problem (Easy)
- Minimum Vertex Cover Problem (Easy)
- Minimum Dominating Set Problem (Medium)
- Subgraph Isomorphism Problem (Hard)
- Minimum Set Cover Problem (Medium)
- Minimum Maximal Matching Problem (Medium)
- Graph Coloring Problem (Easy)
- Graph Edge Coloring Problem (Easy)
- Capacitated Vehicle Routing Problem (CVRP) (Hard)
- Traveling Salesman Problem (Medium)
Combinatorial optimization problems
- Knapsack Problem (Medium)
- Shift Scheduling Problem (Hard)
- LABS problem (Medium)
- Bar Cutting Problem (Hard)
- Integer Linear Programming (Easy)
- Interval Subset Sum Problem (ISSP) (Hard)
Puzzle
- Magic Square (Hard)
- N-Queens Problem (Medium)
Circuit simulation
- Adder Simulation (Medium)
- Multiplier Simulation and Factorization (Hard)
Last updated: 2026.01.26