On the public citation graph

New advances for quantum‐inspired optimization

https://doi.org/10.1111/itor.13420
0 signed · 47 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.1007/978-1-4615-4102-8_1openalex-snapshot
Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges
inferredcites →https://doi.org/10.1007/978-3-031-04520-2_2openalex-snapshot
Applications and Computational Advances for Solving the QUBO Model
inferredcites →https://doi.org/10.1007/bf02115753openalex-snapshot
The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds
inferredcites →https://doi.org/10.1007/s00291-003-0153-3openalex-snapshot
A unified modeling and solution framework for combinatorial optimization problems
inferredcites →https://doi.org/10.1007/s10107-016-1032-4openalex-snapshot
Quadratic reformulations of nonlinear binary optimization problems
inferredcites →https://doi.org/10.1007/s10288-009-0115-yopenalex-snapshot
Diversification-driven tabu search for unconstrained binary quadratic problems
inferredcites →https://doi.org/10.1007/s10288-018-0392-4openalex-snapshot
Linear and quadratic reformulations of nonlinear optimization problems in binary variables
inferredcites →https://doi.org/10.1007/s10288-019-00424-yopenalex-snapshot
Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models
inferredcites →https://doi.org/10.1007/s10288-020-00464-9openalex-snapshot
Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange
inferredcites →https://doi.org/10.1007/s10479-018-3118-2openalex-snapshot
Theoretical and computational study of several linearisation techniques for binary quadratic problems
inferredcites →https://doi.org/10.1007/s10479-022-04634-2openalex-snapshot
Quantum bridge analytics I: a tutorial on formulating and using QUBO models
inferredcites →https://doi.org/10.1007/s10732-011-9189-8openalex-snapshot
Solving large scale Max Cut problems via tabu search
inferredcites →https://doi.org/10.1007/s10878-014-9734-0openalex-snapshot
The unconstrained binary quadratic programming problem: a survey
inferredcites →https://doi.org/10.1007/s10878-019-00511-0openalex-snapshot
Compact quadratizations for pseudo-Boolean functions
inferredcites →https://doi.org/10.1007/s11590-019-01460-7openalex-snapshot
Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions
inferredcites →https://doi.org/10.1016/j.cor.2006.04.002openalex-snapshot
A new modeling and solution approach for the set-partitioning problem
inferredcites →https://doi.org/10.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferredcites →https://doi.org/10.1038/nature10012openalex-snapshot
Quantum annealing with manufactured spins
inferredcites →https://doi.org/10.1038/ncomms5213openalex-snapshot
A variational eigenvalue solver on a photonic quantum processor
inferredcites →https://doi.org/10.1038/s42256-022-00468-6openalex-snapshot
Combinatorial optimization with physics-inspired graph neural networks
inferredcites →https://doi.org/10.1051/ro/197206v200951openalex-snapshot
Brèves communications. 0-1 optimization and non-linear programming
inferredcites →https://doi.org/10.1103/physreva.97.022304openalex-snapshot
Quantum approximate optimization algorithm for MaxCut: A fermionic view
inferredcites →https://doi.org/10.1103/physrevlett.115.077201openalex-snapshot
Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension
inferredcites →https://doi.org/10.1109/tevc.2017.2674800openalex-snapshot
Opposition-Based Memetic Search for the Maximum Diversity Problem
inferredcites →https://doi.org/10.1214/15-aop1084openalex-snapshot
Extremal cuts of sparse random graphs
inferredcites →https://doi.org/10.1287/ijoc.2017.0798openalex-snapshot
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
inferredcites →https://doi.org/10.1504/ijmheur.2011.041196openalex-snapshot
Polynomial unconstrained binary optimisation – Part 1
inferredcites →https://doi.org/10.3389/fphy.2014.00005openalex-snapshot
Ising formulations of many NP problems
inferredcites →https://doi.org/10.3389/fphy.2019.00048openalex-snapshot
Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
inferredcites →https://doi.org/10.48550/arxiv.2107.11695openalex-snapshot
Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions

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-032-00385-0_68openalex-snapshot
Quantum-Inspired Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_68-1openalex-snapshot
Quantum-Inspired Heuristics
inferred← citeshttps://doi.org/10.1007/s10444-026-10292-wopenalex-snapshot
Curve fitting on a quantum annealer for an advanced navigation method
inferred← citeshttps://doi.org/10.1007/s10479-024-06302-zopenalex-snapshot
Contemporary approaches in matheuristics an updated survey
inferred← citeshttps://doi.org/10.1007/s10479-026-07201-1openalex-snapshot
Quantum bridge analytics: a QUBO approach to the uncapacitated facility location problem
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107137openalex-snapshot
Enhanced open-source scatter search algorithm for solving quadratic unconstrained binary optimization problems
inferred← citeshttps://doi.org/10.1088/2058-9565/adcae6openalex-snapshot
Boosting quantum annealing performance through direct polynomial unconstrained binary optimization
inferred← citeshttps://doi.org/10.1103/gpg9-3tjjopenalex-snapshot
Limitations in parallel Ising machine networks: Theory and practice
inferred← citeshttps://doi.org/10.1109/i3ctcon68242.2026.11507453openalex-snapshot
QC-FLP: A Quantum-Inspired Fault Localization Driven Test Case Prioritization Framework for Early Fault Detection
inferred← citeshttps://doi.org/10.1109/tc.2025.3630119openalex-snapshot
SLAM: Extending the Reach of Ising Machine Advantage
inferred← citeshttps://doi.org/10.1111/itor.13471openalex-snapshot
Comparing QUBO models for quantum annealing: integer encodings for permutation problems
inferred← citeshttps://doi.org/10.1145/3696687.3696715openalex-snapshot
Credit Scoring Card Combination Optimization Model Based on QUBO
inferred← citeshttps://doi.org/10.1145/3712256.3726474openalex-snapshot
Solving the Cubic Knapsack Problem using the Quantum-Inspired Digital Annealer Technology
inferred← citeshttps://doi.org/10.1520/jte20260063openalex-snapshot
Weld Defect Classification using a Quantum-Inspired Computational Framework with Data Augmentation
inferred← citeshttps://doi.org/10.2478/qic-2025-0023openalex-snapshot
A Quantum-Inspired Algorithm for Solving Sudoku Puzzles and the MaxCut Problem †
inferred← citeshttps://doi.org/10.3390/encyclopedia5020048openalex-snapshot
Quantum-Inspired Statistical Frameworks: Enhancing Traditional Methods with Quantum Principles
inferred← citeshttps://doi.org/10.3390/math14071236openalex-snapshot
Quantum-Inspired Variational Inference for Non-Convex Stochastic Optimization: A Unified Mathematical Framework with Convergence Guarantees and Applications to Machine Learning in Communication Networks
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.