Pinned Repositories
dimod
A shared API for QUBO/Ising samplers.
dwave_networkx
Source repository for D-Wave NetworkX.
dwavebinarycsp
Map constraint satisfaction problems with binary variables to binary quadratic models.
minorminer
minorminer is a heuristic tool for minor embedding: given a minor and target graph, it tries to find a mapping that embeds the minor into the target.
qbsolv
qbsolv is a metaheuristic or partitioning solver that solves a potentially large quadratic unconstrained binary optimization (QUBO) problem by splitting it into pieces that are solved either on a D-Wave system or via a classical tabu solver.
roamresearch
qbsolv
Qbsolv,a decomposing solver, finds a minimum value of a large quadratic unconstrained binary optimization (QUBO) problem by splitting it into pieces solved either via a D-Wave system or a classical tabu solver. (Note that qbsolv by default uses its internal classical solver. Access to a D-Wave system must be arranged separately.)
dimod
A shared API for QUBO/Ising samplers.
dwave-networkx
D-Wave Systems extension of the NetworkX Python package for graphs and graph algorithms.
minorminer
minorminer is a heuristic tool for minor embedding: given a minor and target graph, it tries to find a mapping that embeds the minor into the target.
aidanproy's Repositories
aidanproy/minorminer
minorminer is a heuristic tool for minor embedding: given a minor and target graph, it tries to find a mapping that embeds the minor into the target.
aidanproy/dwave_networkx
Source repository for D-Wave NetworkX.
aidanproy/dimod
A shared API for QUBO/Ising samplers.
aidanproy/dwavebinarycsp
Map constraint satisfaction problems with binary variables to binary quadratic models.
aidanproy/roamresearch
aidanproy/qbsolv
qbsolv is a metaheuristic or partitioning solver that solves a potentially large quadratic unconstrained binary optimization (QUBO) problem by splitting it into pieces that are solved either on a D-Wave system or via a classical tabu solver.