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
Stargazers
- alexandercbooth@github
- AlexTomesTacoma, WA
- alott-dwD-Wave Systems
- anees042Dubai
- ascarb
- BKJacksonFuzzy Bunny Labs
- bvng1
- cballouformer cto at unbanked
- choucrifahed@finstack
- costypetrisor
- davidsandbergStockholm, Sweden
- developerabhi01AncienTech
- dleacockYoppWorks
- fardinshikhiyevBudapest, Hungary
- fforbeck@openlawteam // prev. @ConsenSys
- JesseScottVancouver
- jx22
- keer25American Express
- laudbGhana
- lazyeasydev
- maxrugen@staffbase
- meetpsMountain View, CA
- MehmetKaplan
- michiogaTokyo, Japan
- NikhilDoWhileVancouver, CA
- nono2357Paris, France
- omimoVancouver, Canada
- PhylliadeRaidium
- prototype23
- RonSadlierOak Ridge, TN
- salinsdeMicrosoft
- simonecorsi@immobiliare
- simsarulhaqvCalicut , Kerala , India
- smseoKrust Universe
- viniciusfk9
- ylanfr