On the public citation graph
GPS: A New TSP Formulation for Its Generalizations Type QUBO
0 signed · 70 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.21751openalex-snapshot
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
inferredcites →https://doi.org/10.1007/978-3-030-14082-3_13openalex-snapshot
Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity
inferredcites →https://doi.org/10.1007/978-3-030-61705-9_21openalex-snapshot
Using the Variational-Quantum-Eigensolver (VQE) to Create an Intelligent Social Workers Schedule Problem Solver
inferredcites →https://doi.org/10.1007/978-3-031-02518-1openalex-snapshot
Adiabatic Quantum Computation and Quantum Annealing
inferredcites →https://doi.org/10.1007/s10107-002-0323-0openalex-snapshot
On the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1007/s10462-022-10238-wopenalex-snapshot
Quantum case-based reasoning (qCBR)
inferredcites →https://doi.org/10.1007/s11128-012-0490-8openalex-snapshot
Adapting the traveling salesman problem to an adiabatic quantum computer
inferredcites →https://doi.org/10.1016/j.biosystems.2004.06.005openalex-snapshot
Solving traveling salesman problems with DNA molecules encoding numerical values
inferredcites →https://doi.org/10.1016/j.neucom.2004.02.006openalex-snapshot
An expanding self-organizing neural network for the traveling salesman problem
inferredcites →https://doi.org/10.1016/s0166-218x(01)00351-1openalex-snapshot
Models, relaxations and exact approaches for the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1016/s0893-6080(03)00056-xopenalex-snapshot
The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem
inferredcites →https://doi.org/10.1038/news000113-10openalex-snapshot
DNA computer helps travelling salesman
inferredcites →https://doi.org/10.1038/nphys2900openalex-snapshot
Evidence for quantum annealing with more than one hundred qubits
inferredcites →https://doi.org/10.1038/s41598-020-77315-4openalex-snapshot
Electronic structure with direct diagonalization on a D-wave quantum annealer
inferredcites →https://doi.org/10.1057/jors.1975.151openalex-snapshot
Some Simple Applications of the Travelling Salesman Problem
inferredcites →https://doi.org/10.1063/1.456888openalex-snapshot
The Fourier grid Hamiltonian method for bound state eigenvalues and eigenfunctions
inferredcites →https://doi.org/10.1080/00029890.1987.12000742openalex-snapshot
An Introduction to the Ising Model
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1103/physreve.70.057701openalex-snapshot
Quantum annealing of the traveling-salesman problem
inferredcites →https://doi.org/10.1109/focs.2016.81openalex-snapshot
Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing
inferredcites →https://doi.org/10.1109/ijcnn48605.2020.9207026openalex-snapshot
Deep Reinforcement Learning for Traveling Salesman Problem with Time Windows and Rejections
inferredcites →https://doi.org/10.1109/scis.2013.6613251openalex-snapshot
Algorithm and knowledge engineering for the TSPTW problem
inferredcites →https://doi.org/10.1126/science.284.5415.779openalex-snapshot
Quantum Annealing of a Disordered Magnet
inferredcites →https://doi.org/10.1137/s00361445023685openalex-snapshot
Teaching Integer Programming Formulations Using the Traveling Salesman Problem
inferredcites →https://doi.org/10.1145/2482767.2482797openalex-snapshot
Experimental evaluation of an adiabiatic quantum system for combinatorial optimization
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
inferredcites →https://doi.org/10.1145/321043.321046openalex-snapshot
Integer Programming Formulation of Traveling Salesman Problems
inferredcites →https://doi.org/10.1287/ijoc.14.4.403.2827openalex-snapshot
A Hybrid Exact Algorithm for the TSPTW
inferredcites →https://doi.org/10.1287/ijoc.3.2.149openalex-snapshot
A Computational Study of the Job-Shop Scheduling Problem
inferredcites →https://doi.org/10.1287/ijoc.3.4.376openalex-snapshot
TSPLIB—A Traveling Salesman Problem Library
inferredcites →https://doi.org/10.1287/opre.16.3.538openalex-snapshot
The Traveling Salesman Problem: A Survey
inferredcites →https://doi.org/10.21203/rs.3.rs-405334/v1openalex-snapshot
Quantum Enhanced Filter: QFilter
inferredcites →https://doi.org/10.22331/q-2018-08-06-79openalex-snapshot
Quantum Computing in the NISQ era and beyond
inferredcites →https://doi.org/10.22606/jaam.2017.22003openalex-snapshot
Small Traveling Salesman Problems
inferredcites →https://doi.org/10.3389/fict.2019.00013openalex-snapshot
A Hybrid Solution Method for the Capacitated Vehicle Routing Problem 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/a12110224openalex-snapshot
A QUBO Model for the Traveling Salesman Problem with Time Windows
inferredcites →https://doi.org/10.4236/jcc.2020.811004openalex-snapshot
Formulation of the Social Workers’ Problem in Quadratic Unconstrained Binary Optimization Form and Solve It on a Quantum Computer
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mma.9489openalex-snapshot
Solving the Kemeny ranking aggregation problem with quantum optimization algorithms
inferred← citeshttps://doi.org/10.1007/s10462-022-10238-wopenalex-snapshot
Quantum case-based reasoning (qCBR)
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.ejor.2025.07.063openalex-snapshot
Quantum computing for discrete optimization: A highlight of three technologies
inferred← citeshttps://doi.org/10.1038/s42005-025-02111-3openalex-snapshot
A coherent approach to quantum-classical optimization
inferred← citeshttps://doi.org/10.1088/2058-9565/add61dopenalex-snapshot
The travelling salesperson problem and the challenges of near-term quantum advantage
inferred← citeshttps://doi.org/10.1109/access.2023.3313102openalex-snapshot
Quadratic Unconstrained Binary Optimization for the Automotive Paint Shop Problem
inferred← citeshttps://doi.org/10.1109/icce59016.2024.10444432openalex-snapshot
A novel and efficient QUBO formulation for the Grid Pathfinding Problem
inferred← citeshttps://doi.org/10.1109/ipdpsw59300.2023.00094openalex-snapshot
Comparative study on the variations of quantum approximate optimization algorithms to the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/ipdpsw66978.2025.00097openalex-snapshot
QUBO++: A C++ Library for Developing and Solving QUBO Problems
inferred← citeshttps://doi.org/10.1109/mnano.2024.3378483openalex-snapshot
VLSI Implementation of an Annealing Accelerator for Solving Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1109/sci68648.2025.11333858openalex-snapshot
GPU-Based Digital Annealing for Accelerating Large-Scale Combinatorial Optimization
inferred← citeshttps://doi.org/10.1109/ssci51031.2022.10022127openalex-snapshot
Quantum hobbit routing: Annealer implementation of generalized Travelling Salesperson Problem
inferred← citeshttps://doi.org/10.1109/tce.2023.3335392openalex-snapshot
An Ising-Machine-Based Solver of Vehicle Routing Problem With Balanced Pick-Up
inferred← citeshttps://doi.org/10.1145/3583133.3595040openalex-snapshot
Introduction to Quantum Optimization
inferred← citeshttps://doi.org/10.1145/3638530.3648420openalex-snapshot
Introduction to Quantum Optimization
inferred← citeshttps://doi.org/10.1145/3708821.3736213openalex-snapshot
Unveiling Privacy Risks in Quantum Optimization Services
inferred← citeshttps://doi.org/10.1145/3712255.3716508openalex-snapshot
Introduction to Quantum Optimization
inferred← citeshttps://doi.org/10.1145/3795101.3807751openalex-snapshot
Introduction to Quantum Optimization
inferred← citeshttps://doi.org/10.22331/q-2025-03-20-1663openalex-snapshot
Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
inferred← citeshttps://doi.org/10.3390/e25081238openalex-snapshot
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.3390/math10214032openalex-snapshot
Preface to the Special Issue on “Quantum Computing Algorithms and Computational Complexity”
inferred← citeshttps://doi.org/10.3390/math11102356openalex-snapshot
Bio-Inspired Multi-UAV Path Planning Heuristics: A Review
inferred← citeshttps://doi.org/10.3390/math11122741openalex-snapshot
Finding Debt Cycles: QUBO Formulations for the Maximum Weighted Cycle Problem Solved Using Quantum Annealing
inferred← citeshttps://doi.org/10.34229/2707-451x.23.2.3openalex-snapshot
An Overview of Algorithms for Solving Vehicle Routing Problems in the Quantum-Classical Cloud
inferred← citeshttps://doi.org/10.37394/232030.2024.3.7openalex-snapshot
Framework for Small Traveling Salesman Problems
inferred← citeshttps://doi.org/10.54097/hset.v68i.12092openalex-snapshot
Application of QUBO model in credit score card combination optimization
inferred← citeshttps://doi.org/10.54364/aaiml.2024.41108openalex-snapshot
Fourier Series Weight in Quantum Machine Learning
inferred← citeshttps://doi.org/10.7240/jeps.1752589openalex-snapshot
Kuantum Yaklaşık Optimizasyon Algoritması İçin Hamilton İşlemcisi İnşası Yöntemlerinin Karşılaştırmalı Analizi
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.