The unconstrained binary quadratic programming problem: a survey
By Gary A. Kochenberger, Jin-Kao Hao, Fred W. Glover, Mark W. Lewis, Zhipeng Lü, Haibo Wang, Yang Wang. Journal of combinatorial optimization, 2014
571 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/a4e8dcc3ef368cd98a1368203363a08e404b63b4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Industrial and Manufacturing Engineering
Citations in the corpus
- Open Source (2014, unknown): “Metaheuristic algorithms are practically used to produce approximate solutions for large QUBO problem instances that cannot be solved exactly due to the high computational complexity (Kochenberger et al. , 2014; Punnen , 2022).”
- Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models (2019, background): “…mathematical formulation known as QUBO, an acronym for a Quadratic Unconstrained Binary Optimization problem, can embrace an exceptional variety of important CO problems found in industry, science and government, as documented in studies such as Kochenberger et al. (2014) and Anthony et al. (2017).”
- Up or Down? Adaptive Rounding for Post-Training Quantization (2020, background): “The complexity of solving it scales rapidly with the dimen-sion of ∆ w ( (cid:96) ) , again prohibiting the application of (13) to even moderately sized layers (Kochenberger et al., 2014).”