A portfolio of solvers for quadratic unconstrained binary optimization (QUBO).
The first set of QUBO problem instances to benchmark the QUBO solvers are obtained from the test cases of Qbsolv \cite{mwbooth2017}.
The portfolio of QUBO solvers use the following algorithms and heuristics:
- genetic algorithm
- \cite{Mishra2016}
- \cite{Messac2015}
- \cite{Mobus2015}
- \cite{Yang2014}
- \cite{Ghedira2013}
- \cite{Kruse2013}
- \cite{Neapolitan2013}
- \cite{Zelinka2013}
- \cite{Yin2012}
- \cite{Grosan2011}
- \cite{Koziel2011}
- \cite{Maniezzo2010}
- \cite{Weise2009}
- \cite{Fulcher2008}
- \cite{Jones2008}
- \cite{CoelloCoello2007}
- \cite{Eberhart2007}
- \cite{Dreo2006}
- \cite{Booker2005}
- \cite{Haupt2004}
- \cite{Menon2004}
- \cite{Eiben2003}
- \cite{CoelloCoello2002}
- \cite{Goldberg2002}
- \cite{CantuPaz2001}
- \cite{Kuo2001}
- \cite{Ausiello1999}
- \cite{Gerez1999}
- \cite{Flake1998}
- \cite{Pedrycz1998}
- \cite{Back1996}
- \cite{Mitchell1996}
- \cite{RaywardSmith1996}
- \cite{Holland1992}
- evolutionary algorithms
- \cite{Ong2018}
- \cite{Lu2016}
- \cite{Mishra2016}
- \cite{Messac2015}
- \cite{Mobus2015}
- \cite{Kramer2014}
- \cite{Ghedira2013}
- \cite{Kruse2013}
- \cite{Neapolitan2013}
- \cite{Zelinka2013}
- \cite{Neri2012}
- \cite{Grosan2011}
- \cite{Hamadi2011}
- \cite{Sanchez2011}
- \cite{Mumford2009}
- \cite{Weise2009}
- \cite{Fulcher2008}
- \cite{Jones2008}
- \cite{Rutkowski2008}
- \cite{CoelloCoello2007}
- \cite{Eberhart2007}
- \cite{Engelbrecht2007}
- \cite{Ashlock2006}
- \cite{DeJong2006}
- \cite{Dreo2006} -- Good
- \cite{Pinter2006}
- \cite{Negnevitsky2005}
- \cite{Eiben2003}
- \cite{Satchell2003}
- \cite{Branke2002}
- \cite{CoelloCoello2002}
- \cite{Sarker2002}
- \cite{Deb2001}
- \cite{VanVeldhuizen2000}
- \cite{VanVeldhuizen1999}
- \cite{Yao1999}
- \cite{Zitzler1999}
- \cite{Drechsler1998a}
- \cite{Flake1998}
- \cite{Pedrycz1998}
- \cite{Schwefel1995}
- \cite{Tsang1993}
- \cite{Holland1992}
- steady-state evolutionary algorithms
- \cite{Fulcher2008}
- parallel evolutionary algorithms
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- \cite{}
- simulated annealing
- \cite{Tanaka2017}
- \cite{Messac2015}
- \cite{Yang2014}
- \cite{Ghedira2013}
- \cite{Zelinka2013}
- \cite{Deng2013}
- \cite{Grosan2011}
- \cite{Koziel2011}
- \cite{Vocking2011}
- \cite{Lange2010}
- \cite{Atallah2009}
- \cite{Wang2009}
- \cite{Weise2009}
- \cite{Cheney2008}
- \cite{Gen2008}
- \cite{Jones2008}
- \cite{Skiena2008}
- \cite{Mohanty2008}
- \cite{Caldarelli2007a}
- \cite{CoelloCoello2007}
- \cite{Dreo2006}
- Formal/Mathematical derivation from Markov Chains.
- \cite{Pinter2006}
- \cite{Burke2005}
- \cite{Liu2005}
- \cite{Haupt2004}
- \cite{CoelloCoello2002}
- \cite{Kuo2001}
- \cite{Atallah1999}
- \cite{Ausiello1999}
- \cite{Gerez1999}
- \cite{Gershenfeld1999}
- \cite{Lange1999}
- \cite{Gerez1999}
- \cite{Sherwani1999}
- \cite{Bertsimas1997}
- \cite{RaywardSmith1996}
- \cite{Gajski1992}
- \cite{Otten1989}
- \cite{Sechen1988}
- \cite{Wong1988}
- quantum annealing
- \cite{Tanaka2017}
- \cite{King2015}
- \cite{McGeoch2014}
The MIT License (MIT)
Copyright (c) <2016> Zhiyang Ong
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Email address: echo "cukj -wb- 23wU4X5M589 TROJANS cqkH wiuz2y 0f Mw Stanford" | awk '{ sub("23wU4X5M589","F.d_c_b. ") sub("Stanford","d0mA1n"); print $5, $2, $8; for (i=1; i<=1; i++) print "6\b"; print $9, $7, $6 }' | sed y/kqcbuHwM62z/gnotrzadqmC/ | tr 'q' ' ' | tr -d [:cntrl:] | tr -d 'ir' | tr y "\n" Don't compromise my computing accounts. You have been warned.