The DOI matches its Crossref record; 81 of the 91 references it cites were found in a registry or an index.
Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Finally, Ajagekar et al. [2] presented four examples of large-scale optimization problems solved with problem class-specific hybrid decomposition techniques: molecular conformation, job-shop-scheduling, manufacturing cell formation, and vehicle routing [2].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [2]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134 · cited 1×
“Heuristic techniques such as simulated annealing [6], genetic algorithms [7], tabu search [8] and others have also grown popular owing to their easy implementation and little prior knowledge requirement of the optimization problem.”
MethodQuantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830 · cited 1×
“QC’s major applications can be perceived in areas of optimization, machine learning, cryptography, and quantum chemistry [16].”
BackgroundAlgorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 1×
“This is evident from QC techniques like Shor’s algorithm for integer factorization [11], Grover’s search algorithm for unstructured databases [12], quantum algorithm for linear system of equations [13], and many more [14].”
MethodQuantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 1×
“This is evident from QC techniques like Shor’s algorithm for integer factorization [11], Grover’s search algorithm for unstructured databases [12], quantum algorithm for linear system of equations [13], and many more [14].”
Method(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,049
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,958 · cited 2×
“The proposed hybrid QC-MIQP stepwise decomposition method is based on Bender’s decomposition [65], by considering the above manufacturing cell formation problem given in Eq.”
MethodQuantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 1×
“This is evident from QC techniques like Shor’s algorithm for integer factorization [11], Grover’s search algorithm for unstructured databases [12], quantum algorithm for linear system of equations [13], and many more [14].”
MethodIsing formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512 · cited 1×
“A Hamiltonian is a mathematical description of the physical system in terms of its energies and corresponds to the objective function of an optimization problem [29].”
Background
Research works printed but not linked: 1
- Golden, 2008, vol. 43
Cited by
Sorted by citations
Quantum-inspired metaheuristic algorithms: comprehensive survey and classification
Gharehchopogh, F. S. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-022-10280-8 · Cited by 271
Standard model physics and the digital quantum revolution: thoughts about the interface
Klco, N., Roggero, A., & A, M. J. S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac58a4 · Cited by 209
Ajagekar, A., & You, F. (2022) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2022.112493 · Cited by 164
Self-citationQuantum computing challenges in the software industry. A fuzzy AHP-based approach
Awan, U., Hannola, L., Tandon, A., Goyal, R. K., & Dhir, A. (2022) · Information and Software Technology · doi:10.1016/j.infsof.2022.106896 · Cited by 163
An Improved Hybrid Swarm Intelligence for Scheduling IoT Application Tasks in the Cloud
Attiya, I., Elaziz, M. A., Abualigah, L., Nguyen, T. N., & El‐Latif, A. A. A. (2022) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2022.3148288 · Cited by 128
Metadata
- Authors
- Ajagekar, A., Humble, T., & You, F.
- Affiliations
- Cornell University (US)
- Oak Ridge National Laboratory (US)
- Corresponding author
- You, Fengqi
- Venue
- Computers & Chemical Engineering
- Publisher
- Elsevier BV
- Published
- 2020-01
- Volume
- 132
- Pages
- 106630
- ISSN
- 0098-1354 (ISSN-L)
- OpenAlex
- W2982469373
- Cited by
- 191
- References
- 91
- Citations by year
- 2026: 19 · 2025: 37 · 2024: 35 · 2023: 28 · 2022: 30 · 2021: 25 · 2020: 17
- FWCI
- 8.31
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Computers & Chemical Engineering (acceptedVersion)
- arXiv (Cornell University) (submittedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. Department of Energy (AC05-00OR22725, DE--AC05--00OR22725, DE-AC05?, 00OR22725)
- Office of Science (DEAC05- 00OR22725, AC05-00OR22725)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- quantum computing, hybrid quantum-classical algorithms, mixed integer programming, large-scale optimization, molecular conformation, job shop scheduling, manufacturing cell formation, vehicle routing, combinatorial optimization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
