On the public citation graph

Quantum Optimisation for Supply Chain: QUBO Formulations and QAOA Solutions for Facility Location and Load Balancing

0 signed · 21 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-3-031-04520-2_2openalex-snapshot
Applications and Computational Advances for Solving the QUBO Model
inferredcites →https://doi.org/10.1007/978-3-031-62799-6_13openalex-snapshot
An Experimental Comparison of Qiskit and Pennylane for Hybrid Quantum-Classical Support Vector Machines
inferredcites →https://doi.org/10.1007/s11128-024-04560-1openalex-snapshot
Evaluating the practicality of quantum optimization algorithms for prototypical industrial applications
inferredcites →https://doi.org/10.1007/s42979-021-00466-2openalex-snapshot
Implementation of a Hybrid Classical-Quantum Annealing Algorithm for Logistic Network Design
inferredcites →https://doi.org/10.1007/s43762-022-00070-xopenalex-snapshot
Using quantum computing to solve the maximal covering location problem
inferredcites →https://doi.org/10.1016/j.asoc.2022.109840openalex-snapshot
A balanced-quantum inspired evolutionary algorithm for solving disassembly line balancing problem
inferredcites →https://doi.org/10.1016/j.ejor.2023.03.013openalex-snapshot
Application of quantum approximate optimization algorithm to job shop scheduling problem
inferredcites →https://doi.org/10.1016/j.eswa.2022.116953openalex-snapshot
A new tool for automated transformation of Quadratic Assignment Problem instances to Quadratic Unconstrained Binary Optimisation models
inferredcites →https://doi.org/10.1016/j.physrep.2024.03.002openalex-snapshot
A review on Quantum Approximate Optimization Algorithm and its variants
inferredcites →https://doi.org/10.1038/s41567-020-01105-yopenalex-snapshot
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
inferredcites →https://doi.org/10.1038/s41598-022-14767-wopenalex-snapshot
Scaling quantum approximate optimization on near-term hardware
inferredcites →https://doi.org/10.1038/s41598-024-66625-6openalex-snapshot
The effect of classical optimizers and Ansatz depth on QAOA performance in noisy devices
inferredcites →https://doi.org/10.1038/s42254-021-00348-9openalex-snapshot
Variational quantum algorithms
inferredcites →https://doi.org/10.1038/s44172-023-00061-8openalex-snapshot
Data-driven quantum approximate optimization algorithm for power systems
inferredcites →https://doi.org/10.1088/1361-6633/ac8c54openalex-snapshot
Quantum annealing for industry applications: introduction and review
inferredcites →https://doi.org/10.1103/revmodphys.94.015004openalex-snapshot
Noisy intermediate-scale quantum algorithms
inferredcites →https://doi.org/10.1108/ijpdlm-02-2023-0065openalex-snapshot
Quantum-inspired computing technology in operations and logistics management
inferredcites →https://doi.org/10.1109/saner53432.2022.00149openalex-snapshot
How to Approximate any Objective Function via Quadratic Unconstrained Binary Optimization
inferredcites →https://doi.org/10.1109/tc.2021.3063618openalex-snapshot
PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
inferredcites →https://doi.org/10.1145/3700874openalex-snapshot
A Systematic Mapping Study on Quantum and Quantum-inspired Algorithms in Operations Research
inferredcites →https://doi.org/10.1287/opre.15.6.1171openalex-snapshot
Letter to the Editor—Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming 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.