{
  "built_at": "2026-07-12T15:58:53Z",
  "commit": "0eee723055aff74014b695001974cc749f6b41ff",
  "total_instances": 1256,
  "total_submissions": 1830,
  "problems": [
    {
      "id": "01",
      "slug": "marketsplit",
      "name": "Market Split",
      "short": "Multi-dimensional Subset Sum",
      "why": "These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.",
      "type": "Binary",
      "formulation": "QUBO / ILP",
      "minimize": true,
      "tags": [
        "combinatorial",
        "NP-hard",
        "subset-sum"
      ],
      "vars_min": 50,
      "vars_max": 200,
      "instance_count": 156,
      "solved_count": 115,
      "solved_classical_count": 115,
      "classical_best_known_count": 0,
      "classical_found_count": 0,
      "best_known_count": 0,
      "open_count": 41,
      "quantum_solved_count": 0,
      "quantum_best_known_count": 0,
      "quantum_found_count": 0,
      "quantum_hw_solved_count": 0,
      "quantum_sim_solved_count": 0,
      "github_url": "https://github.com/ZIB-AOPT/QOBLIB/tree/0eee723055aff74014b695001974cc749f6b41ff/01-marketsplit",
      "data_path": "data/problems/01"
    },
    {
      "id": "02",
      "slug": "labs",
      "name": "LABS",
      "short": "Low Autocorrelation Binary Sequences",
      "why": "LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes harder as sequence length grows.",
      "type": "Binary",
      "formulation": "QUBO",
      "minimize": true,
      "tags": [
        "signal-processing",
        "dense",
        "NP-hard"
      ],
      "vars_min": null,
      "vars_max": null,
      "instance_count": 99,
      "solved_count": 39,
      "solved_classical_count": 39,
      "classical_best_known_count": 60,
      "classical_found_count": 0,
      "best_known_count": 60,
      "open_count": 0,
      "quantum_solved_count": 5,
      "quantum_best_known_count": 0,
      "quantum_found_count": 0,
      "quantum_hw_solved_count": 4,
      "quantum_sim_solved_count": 1,
      "github_url": "https://github.com/ZIB-AOPT/QOBLIB/tree/0eee723055aff74014b695001974cc749f6b41ff/02-labs",
      "data_path": "data/problems/02"
    },
    {
      "id": "03",
      "slug": "birkhoff",
      "name": "Min. Birkhoff Decomposition",
      "short": "Doubly Stochastic Matrix Decomposition",
      "why": "Minimum Birkhoff decomposition links assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.",
      "type": "Binary + Integer",
      "formulation": "MIP / QUBO",
      "minimize": true,
      "tags": [
        "matrix-theory",
        "combinatorial",
        "telecommunications"
      ],
      "vars_min": 3,
      "vars_max": 16,
      "instance_count": 280,
      "solved_count": 66,
      "solved_classical_count": 66,
      "classical_best_known_count": 214,
      "classical_found_count": 0,
      "best_known_count": 214,
      "open_count": 0,
      "quantum_solved_count": 0,
      "quantum_best_known_count": 0,
      "quantum_found_count": 0,
      "quantum_hw_solved_count": 0,
      "quantum_sim_solved_count": 0,
      "github_url": "https://github.com/ZIB-AOPT/QOBLIB/tree/0eee723055aff74014b695001974cc749f6b41ff/03-birkhoff",
      "data_path": "data/problems/03"
    },
    {
      "id": "04",
      "slug": "steiner",
      "name": "Steiner Tree Packing",
      "short": "VLSI Design / Wire Routing",
      "why": "Steiner tree packing models wire-routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.",
      "type": "Binary",
      "formulation": "ILP / QUBO",
      "minimize": true,
      "tags": [
        "graph-theory",
        "VLSI",
        "NP-hard"
      ],
      "vars_min": null,
      "vars_max": null,
      "instance_count": 190,
      "solved_count": 29,
      "solved_classical_count": 29,
      "classical_best_known_count": 14,
      "classical_found_count": 0,
      "best_known_count": 14,
      "open_count": 147,
      "quantum_solved_count": 0,
      "quantum_best_known_count": 0,
      "quantum_found_count": 0,
      "quantum_hw_solved_count": 0,
      "quantum_sim_solved_count": 0,
      "github_url": "https://github.com/ZIB-AOPT/QOBLIB/tree/0eee723055aff74014b695001974cc749f6b41ff/04-steiner",
      "data_path": "data/problems/04"
    },
    {
      "id": "05",
      "slug": "sports",
      "name": "Sports Tournament Scheduling",
      "short": "Constraint Satisfaction / Scheduling",
      "why": "Sports timetabling captures realistic constraint interactions from round-robin tournaments, with instances selected for diversity and difficulty.",
      "type": "Binary",
      "formulation": "ILP / QUBO",
      "minimize": true,
      "tags": [
        "scheduling",
        "CSP",
        "symmetry-rich"
      ],
      "vars_min": 0,
      "vars_max": 152,
      "instance_count": 249,
      "solved_count": 147,
      "solved_classical_count": 147,
      "classical_best_known_count": 0,
      "classical_found_count": 0,
      "best_known_count": 0,
      "open_count": 102,
      "quantum_solved_count": 0,
      "quantum_best_known_count": 0,
      "quantum_found_count": 0,
      "quantum_hw_solved_count": 0,
      "quantum_sim_solved_count": 0,
      "github_url": "https://github.com/ZIB-AOPT/QOBLIB/tree/0eee723055aff74014b695001974cc749f6b41ff/05-sports",
      "data_path": "data/problems/05"
    },
    {
      "id": "06",
      "slug": "portfolio",
      "name": "Portfolio Optimization",
      "short": "Multi-period with Transaction Costs & Short Selling",
      "why": "Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.",
      "type": "Binary + Continuous",
      "formulation": "MIQP / QUBO",
      "minimize": true,
      "tags": [
        "finance",
        "MIQP",
        "real-world"
      ],
      "vars_min": 5,
      "vars_max": 6,
      "instance_count": 130,
      "solved_count": 22,
      "solved_classical_count": 22,
      "classical_best_known_count": 106,
      "classical_found_count": 0,
      "best_known_count": 108,
      "open_count": 0,
      "quantum_solved_count": 0,
      "quantum_best_known_count": 2,
      "quantum_found_count": 0,
      "quantum_hw_solved_count": 0,
      "quantum_sim_solved_count": 0,
      "github_url": "https://github.com/ZIB-AOPT/QOBLIB/tree/0eee723055aff74014b695001974cc749f6b41ff/06-portfolio",
      "data_path": "data/problems/06"
    },
    {
      "id": "07",
      "slug": "independentset",
      "name": "Maximum Independent Set",
      "short": "Unweighted MIS on Hard Graphs",
      "why": "Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.",
      "type": "Binary",
      "formulation": "QUBO",
      "minimize": false,
      "tags": [
        "graph-theory",
        "NP-hard",
        "benchmark-classic"
      ],
      "vars_min": 1,
      "vars_max": 1000,
      "instance_count": 50,
      "solved_count": 39,
      "solved_classical_count": 39,
      "classical_best_known_count": 11,
      "classical_found_count": 0,
      "best_known_count": 11,
      "open_count": 0,
      "quantum_solved_count": 5,
      "quantum_best_known_count": 0,
      "quantum_found_count": 2,
      "quantum_hw_solved_count": 4,
      "quantum_sim_solved_count": 1,
      "github_url": "https://github.com/ZIB-AOPT/QOBLIB/tree/0eee723055aff74014b695001974cc749f6b41ff/07-independentset",
      "data_path": "data/problems/07"
    },
    {
      "id": "08",
      "slug": "network",
      "name": "Network Design",
      "short": "Telecommunications Network Planning",
      "why": "Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.",
      "type": "Binary",
      "formulation": "ILP / QUBO",
      "minimize": true,
      "tags": [
        "network",
        "telecommunications",
        "NP-hard"
      ],
      "vars_min": null,
      "vars_max": null,
      "instance_count": 20,
      "solved_count": 6,
      "solved_classical_count": 6,
      "classical_best_known_count": 14,
      "classical_found_count": 0,
      "best_known_count": 14,
      "open_count": 0,
      "quantum_solved_count": 0,
      "quantum_best_known_count": 0,
      "quantum_found_count": 0,
      "quantum_hw_solved_count": 0,
      "quantum_sim_solved_count": 0,
      "github_url": "https://github.com/ZIB-AOPT/QOBLIB/tree/0eee723055aff74014b695001974cc749f6b41ff/08-network",
      "data_path": "data/problems/08"
    },
    {
      "id": "09",
      "slug": "routing",
      "name": "Vehicle Routing",
      "short": "VRP with Time Windows + Capacity",
      "why": "Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.",
      "type": "Binary",
      "formulation": "ILP / QUBO",
      "minimize": true,
      "tags": [
        "logistics",
        "VRP",
        "real-world"
      ],
      "vars_min": 1,
      "vars_max": 55,
      "instance_count": 55,
      "solved_count": 54,
      "solved_classical_count": 54,
      "classical_best_known_count": 1,
      "classical_found_count": 0,
      "best_known_count": 1,
      "open_count": 0,
      "quantum_solved_count": 0,
      "quantum_best_known_count": 0,
      "quantum_found_count": 0,
      "quantum_hw_solved_count": 0,
      "quantum_sim_solved_count": 0,
      "github_url": "https://github.com/ZIB-AOPT/QOBLIB/tree/0eee723055aff74014b695001974cc749f6b41ff/09-routing",
      "data_path": "data/problems/09"
    },
    {
      "id": "10",
      "slug": "topology",
      "name": "Topology Design",
      "short": "Graph Golf / Node-Degree-Diameter Problem",
      "why": "Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.",
      "type": "Binary",
      "formulation": "QUBO / ILP",
      "minimize": true,
      "tags": [
        "graph-theory",
        "network-design",
        "combinatorial"
      ],
      "vars_min": 15,
      "vars_max": 1000000,
      "instance_count": 27,
      "solved_count": 12,
      "solved_classical_count": 12,
      "classical_best_known_count": 4,
      "classical_found_count": 0,
      "best_known_count": 14,
      "open_count": 1,
      "quantum_solved_count": 0,
      "quantum_best_known_count": 0,
      "quantum_found_count": 0,
      "quantum_hw_solved_count": 0,
      "quantum_sim_solved_count": 0,
      "github_url": "https://github.com/ZIB-AOPT/QOBLIB/tree/0eee723055aff74014b695001974cc749f6b41ff/10-topology",
      "data_path": "data/problems/10"
    }
  ]
}