{"problem_types":[{"description":"Partition graph vertices to maximize edges crossing the cut","domains":["Graph Theory","Network Design","VLSI"],"example":{"edges":[[0,1,1.0],[1,2,1.0],[2,3,1.0],[3,4,1.0],[4,0,1.0]],"n":5,"preset":"fast","problem_type":"maxcut"},"name":"Maximum Cut","parameters":{"edges":"[[i, j, weight], ...]","n":"vertices"},"type":"maxcut"},{"description":"Minimize E = -0.5 * s^T J s - h^T s over spin configurations","domains":["Statistical Mechanics","Materials Science","Drug Discovery"],"example":{"matrix":[0,-1,0.5,-1,0,1,0.5,1,0],"n":3,"preset":"fast","problem_type":"ising"},"name":"Ising Model","parameters":{"field":"optional external field","matrix":"flattened n*n coupling","n":"spins"},"type":"ising"},{"description":"Minimize x^T Q x over binary variables","domains":["Finance","Logistics","Machine Learning"],"example":{"matrix":[1,-2,0,0,0,1,-1,0,0,0,2,-1,0,0,0,1],"n":4,"preset":"fast","problem_type":"qubo"},"name":"Quadratic Unconstrained Binary Optimization","parameters":{"matrix":"flattened n*n upper-triangular Q","n":"variables"},"type":"qubo"},{"description":"Find variable assignment satisfying all clauses (CNF)","domains":["Verification","AI Planning","Cryptanalysis"],"example":{"clauses":[[1,2,-3],[-1,3,4],[2,-4,5]],"n":5,"preset":"fast","problem_type":"sat"},"name":"Boolean Satisfiability","parameters":{"clauses":"[[lit, lit, lit], ...] (negative = negated)","n":"variables"},"type":"sat"},{"description":"Find shortest tour visiting all cities exactly once","domains":["Logistics","Supply Chain","Routing"],"example":{"distances":[0,10,15,20,10,0,35,25,15,35,0,30,20,25,30,0],"n":4,"penalty":10.0,"preset":"fast","problem_type":"tsp"},"name":"Traveling Salesman Problem","parameters":{"distances":"flattened n*n distance matrix","n":"cities","penalty":"constraint weight"},"type":"tsp"},{"description":"2-color edges of complete graph K_n avoiding monochromatic K_k cliques","domains":["Combinatorics","Network Theory","Coding Theory"],"example":{"clique_size":4,"n":9,"preset":"fast","problem_type":"ramsey"},"name":"Ramsey Graph Coloring","parameters":{"clique_size":"forbidden clique size (3-5)","n":"vertices"},"type":"ramsey"}]}