On the public citation graph

Experimental Analysis of Quantum Annealers and Hybrid Solvers Using Benchmark Optimization Problems

0 signed · 44 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-0118(199902)30:2<137::aid-jgt7>3.0.co;2-gopenalex-snapshot
Fast generation of regular graphs and construction of cages
inferredcites →https://doi.org/10.1007/978-3-030-15843-9_22openalex-snapshot
Studying the Impact of Perturbation Methods on the Efficiency of GVNS for the ATSP
inferredcites →https://doi.org/10.1007/bf02650179openalex-snapshot
Simulating physics with computers
inferredcites →https://doi.org/10.1007/s10732-007-9009-3openalex-snapshot
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)
inferredcites →https://doi.org/10.1007/s10773-020-04628-5openalex-snapshot
An Improved Noise Quantum Annealing Method for TSP
inferredcites →https://doi.org/10.1007/s11047-008-9098-4openalex-snapshot
A survey on metaheuristics for stochastic combinatorial optimization
inferredcites →https://doi.org/10.1007/s11128-008-0082-9openalex-snapshot
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
inferredcites →https://doi.org/10.1007/s11128-021-03321-8openalex-snapshot
Mapping a logical representation of TSP to quantum annealing
inferredcites →https://doi.org/10.1007/s42452-019-1829-xopenalex-snapshot
Solving the traveling salesman problem on a quantum annealer
inferredcites →https://doi.org/10.1016/b978-0-12-381479-1.00003-4openalex-snapshot
Data Preprocessing
inferredcites →https://doi.org/10.1017/s1471068418000066openalex-snapshot
Performing fully parallel constraint logic programming on a quantum annealer
inferredcites →https://doi.org/10.1103/physreve.58.5355openalex-snapshot
Quantum annealing in the transverse Ising model
inferredcites →https://doi.org/10.1103/physreve.70.057701openalex-snapshot
Quantum annealing of the traveling-salesman problem
inferredcites →https://doi.org/10.1103/revmodphys.25.353openalex-snapshot
On the Theory of the Ising Model of Ferromagnetism
inferredcites →https://doi.org/10.1109/iisa.2015.7388106openalex-snapshot
Initialization methods for the TSP with Time Windows using Variable Neighborhood Search
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/s0036144598347011openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/937503.937505openalex-snapshot
Metaheuristics in combinatorial optimization
inferredcites →https://doi.org/10.1287/ijoc.3.4.376openalex-snapshot
TSPLIB—A Traveling Salesman Problem Library
inferredcites →https://doi.org/10.3389/fict.2017.00029openalex-snapshot
Traffic Flow Optimization Using a Quantum Annealer
inferredcites →https://doi.org/10.3389/fphy.2014.00005openalex-snapshot
Ising formulations of many NP problems
inferredcites →https://doi.org/10.3390/a11040038openalex-snapshot
Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection
inferredcites →https://doi.org/10.3390/a12110224openalex-snapshot
A QUBO Model for the Traveling Salesman Problem with Time Windows
inferredcites →https://doi.org/10.3390/asi2040031openalex-snapshot
A Performance Study of the Impact of Different Perturbation Methods on the Efficiency of GVNS for Solving TSP
inferredcites →https://doi.org/10.3390/technologies7030061openalex-snapshot
Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows
inferredcites →https://doi.org/10.3969/j.issn.1004-4132.2010.02.025openalex-snapshot
Improved ant colony optimization algorithm for the traveling salesman problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-75013-7_7openalex-snapshot
Comparison of D-Wave Quantum Computing Environment Solvers for a Two-Machine Jobs Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-77738-7_35openalex-snapshot
Hybrid Quantum Solvers in Production: How to Succeed in the NISQ Era?
inferred← citeshttps://doi.org/10.1007/978-3-032-07998-5_7openalex-snapshot
Comparing Quantum Annealer and Metaheuristic Methods to Solve the Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/s11128-025-04870-yopenalex-snapshot
Review of the application of quantum annealing-related technologies in transportation optimization
inferred← citeshttps://doi.org/10.1016/j.cherd.2025.08.031openalex-snapshot
Towards scalable quantum annealing for pooling and blending problems: A methodological proof-of-concept
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2024.108704openalex-snapshot
Dynamic optimization on quantum hardware: Feasibility for a process industry use case
inferred← citeshttps://doi.org/10.1016/j.future.2024.02.016openalex-snapshot
Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problem
inferred← citeshttps://doi.org/10.1016/j.neucom.2025.132067openalex-snapshot
Optimizing two-machine scheduling in flexible manufacturing systems using autonomous AI and quantum computing
inferred← citeshttps://doi.org/10.1016/j.physa.2026.131649openalex-snapshot
Quantum approaches to the traveling salesman problem: A critical review of formulations, complexity, and implementation limits
inferred← citeshttps://doi.org/10.1109/isc257844.2023.10293427openalex-snapshot
EV Charger Placement Optimization using D-Wave Quantum Computing Solvers
inferred← citeshttps://doi.org/10.1109/mnano.2025.3638505openalex-snapshot
A High-Performance Digital QUBO Solver for Quantum-Inspired Optimization
inferred← citeshttps://doi.org/10.1142/s0219749925400039openalex-snapshot
Solving the traveling salesman problem via different quantum computing architectures
inferred← citeshttps://doi.org/10.1145/3638529.3654131openalex-snapshot
Applying a Quantum Annealer to the Traffic Assignment Problem
inferred← citeshttps://doi.org/10.2139/ssrn.4836033openalex-snapshot
Quantum Algorithms for Solving the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.32604/jqc.2023.044786openalex-snapshot
Comparison among Classical, Probabilistic and Quantum Algorithms for Hamiltonian Cycle Problem
inferred← citeshttps://doi.org/10.3390/make6030093openalex-snapshot
Visual Reasoning and Multi-Agent Approach in Multimodal Large Language Models (MLLMs): Solving TSP and mTSP Combinatorial Challenges
inferred← citeshttps://doi.org/10.37394/232030.2024.3.7openalex-snapshot
Framework for Small Traveling Salesman Problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.