dwavesystems/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.)
qApache-2.0
Watchers
- greyseason
- joepangallo
- Kaizenathonearth
- shacharm2Tel Aviv
- AvinashGuptaIndia
- mwbooth
- federicoviscomiUK
- nuwangunasekara
- afrhu
- quaxquax
- dwsysadmin
- nbsrujan
- psmlbhor
- archerbroler
- rheinekeNew York City
- ButsuriTokyo, Japan ⇨ Ottawa, ON, Canada
- wangsen992South Bend, IN
- tronzeus
- luocs
- MoshiasriMumbai, India
- AlexCAPS
- Mlearn
- aidanproy
- kevinsegalLos Angeles, CA
- jjensenral
- xpcloveShanghai
- fo0dIdaho
- sghowellLos Angeles, CA
- dillonalynchSan Jose, CA
- hayral
- arcondelloBritish Columbia, Canada
- ChristopherFunkWinnipeg, MB, Canada
- michiogaTokyo, Japan
- hongyunnchen
- jfoxdevPennsylvania
- gopal-m