pith. machine review for the scientific record. sign in

arxiv: 2604.20321 · v1 · submitted 2026-04-22 · 🪐 quant-ph

Recognition: unknown

Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem

Alessia Ciacco , Luigi Di Puglia Pugliese , Francesca Guerriero
Authors on Pith no claims yet

Pith reviewed 2026-05-10 00:34 UTC · model grok-4.3

classification 🪐 quant-ph
keywords traveling salesman problemcutting planequantum annealingsubtour eliminationmodel reductionhybrid quantum solverscombinatorial optimization
0
0 comments X

The pith

Iterative addition of subtour constraints and arc preprocessing shrinks TSP models and speeds up solving on classical and quantum systems.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that a cutting-plane strategy for the Traveling Salesman Problem, which adds subtour elimination constraints only when needed and preprocesses to drop unnecessary arcs, produces much smaller optimization models. This reduction leads to better computational performance whether the models are solved classically, directly on a quantum annealer, or with hybrid quantum-classical methods. A reader would care because the standard TSP formulation requires too many constraints for large instances, making it impractical for quantum hardware with limited resources. Experiments confirm that these techniques cut model size and improve run times across the board.

Core claim

By using an iterative approach to generate subtour elimination constraints dynamically and applying preprocessing to reduce candidate arcs, the resulting models for the Traveling Salesman Problem are significantly smaller and solve faster under classical optimization, direct quantum annealing on D-Wave hardware, and hybrid solvers.

What carries the argument

The cutting-plane methodology that dynamically generates subtour elimination constraints together with arc preprocessing, which works to reduce the number of variables and constraints in the integer programming formulation of TSP.

If this is right

  • Models with fewer arcs and constraints can be embedded more easily onto quantum processors with limited connectivity and qubits.
  • Hybrid solvers benefit from the reduced problem size when classical parts handle the iterative constraint addition.
  • The framework allows solving larger TSP instances than would be possible with the full set of constraints from the start.
  • Performance gains hold for both quantum and classical approaches, suggesting the method is solver-agnostic.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar dynamic constraint generation could help with other routing problems that suffer from exponential numbers of constraints, such as the vehicle routing problem.
  • Testing on actual D-Wave hardware with the reduced models might reveal if the quantum advantage emerges only after this preprocessing step.
  • Extending the preprocessing to include more advanced arc elimination rules could further decrease model sizes for very large cities.

Load-bearing premise

That adding subtour constraints one by one during solving and removing some arcs beforehand will always result in smaller, easier models for quantum annealers without creating too much extra computational cost or missing good solutions.

What would settle it

A test where the proposed method is applied to standard TSP benchmark instances with 20-50 cities and the model size (number of variables and constraints) and solving time on D-Wave hybrid solver are compared to the standard full formulation; if no consistent reduction or improvement occurs, the claim fails.

Figures

Figures reproduced from arXiv: 2604.20321 by Alessia Ciacco, Francesca Guerriero, Luigi Di Puglia Pugliese.

Figure 1
Figure 1. Figure 1: Decomposition of the overall computational time into its main components, highlighting their hierarchical [PITH_FULL_IMAGE:figures/full_fig_p013_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: General structure of D-Wave’s hybrid solvers, from Ciacco et al. (2025d). [PITH_FULL_IMAGE:figures/full_fig_p014_2.png] view at source ↗
read the original abstract

The Traveling Salesman Problem is a classical NP-hard combinatorial optimization problem that has been extensively studied in operations research. A major challenge in Traveling Salesman Problem formulations is the large number of subtour elimination constraints required to ensure a valid tour. To address this issue, we adopt an iterative approach grounded in well-established operations research techniques, in which subtour elimination constraints are generated dynamically. In addition, we integrate a preprocessing phase to reduce the number of candidate arcs. In this work, we investigate both classical and quantum optimization approaches for solving the problem using the proposed framework. In particular, for quantum optimization we analyze quantum annealing techniques within the D-Wave framework, considering both direct quantum execution on the QPU and hybrid quantum classical solvers. Computational experiments show that the proposed strategies significantly reduce the model size and lead to positive improvements in computational performance across classical, direct quantum, and hybrid optimization approaches.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes an iterative cutting-plane framework for the TSP that dynamically generates subtour-elimination constraints and applies arc preprocessing to shrink the set of candidate arcs. The resulting models are solved via classical ILP, direct quantum annealing on D-Wave hardware, and hybrid quantum-classical solvers; the authors report that these strategies yield substantially smaller models and improved run times across all three regimes.

Significance. If the reported gains survive a complete accounting of iteration overhead, the work would demonstrate a practical way to adapt classical cutting-plane techniques to the limited scale and connectivity of current quantum annealers, thereby extending the reach of quantum optimization to larger TSP instances without requiring a full reformulation at every step.

major comments (2)
  1. [Computational Experiments] Computational Experiments section: the performance numbers for direct quantum annealing do not state whether the reported wall-clock times include the per-iteration costs of (i) classical subtour detection, (ii) reconstruction of the QUBO with new penalty terms, and (iii) re-embedding the logical graph onto the Chimera/Pegasus topology. Because these costs scale with the number of cutting-plane rounds and are absent from the classical ILP baseline, the net improvement claimed for the direct-quantum path cannot be assessed from the given data.
  2. [Abstract and Computational Experiments] Abstract and §4: the claim that the strategies 'significantly reduce the model size' is presented without quantitative tables showing, for each instance, the number of variables/constraints before and after preprocessing and dynamic addition, the iteration count, or the final gap to optimality. Without these figures the magnitude of the reduction and its dependence on instance size remain unclear.
minor comments (2)
  1. [Abstract] The abstract would be strengthened by the inclusion of one or two concrete quantitative results (e.g., average model-size reduction factor and average speed-up on a representative set of instances).
  2. [Quantum Annealing Formulation] Notation for the QUBO penalty coefficients and the embedding procedure should be introduced once and used consistently; currently the same symbols appear to be reused for logically distinct quantities.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed comments. We address each major point below and will revise the manuscript accordingly to improve clarity and completeness.

read point-by-point responses

  1. Referee: [Computational Experiments] Computational Experiments section: the performance numbers for direct quantum annealing do not state whether the reported wall-clock times include the per-iteration costs of (i) classical subtour detection, (ii) reconstruction of the QUBO with new penalty terms, and (iii) re-embedding the logical graph onto the Chimera/Pegasus topology. Because these costs scale with the number of cutting-plane rounds and are absent from the classical ILP baseline, the net improvement claimed for the direct-quantum path cannot be assessed from the given data.

    Authors: We agree that a complete accounting of all computational costs is necessary for a fair evaluation of the direct quantum approach. The current manuscript reports primarily the QPU annealing and access times without explicitly breaking out the classical per-iteration overheads. In the revised version, we will expand the Computational Experiments section to include a full timing breakdown for the quantum paths: classical subtour detection, QUBO reconstruction with updated penalties, and re-embedding costs. We will also report aggregate wall-clock times that incorporate these overheads and directly compare them to the classical ILP baseline, enabling readers to assess net performance gains. revision: yes

  2. Referee: [Abstract and Computational Experiments] Abstract and §4: the claim that the strategies 'significantly reduce the model size' is presented without quantitative tables showing, for each instance, the number of variables/constraints before and after preprocessing and dynamic addition, the iteration count, or the final gap to optimality. Without these figures the magnitude of the reduction and its dependence on instance size remain unclear.

    Authors: We concur that quantitative details are required to substantiate the model-size reduction claims. The revised manuscript will augment both the Abstract and Section 4 with tables that, for every TSP instance, report: initial and final numbers of variables and constraints (after preprocessing and dynamic constraint addition), the number of cutting-plane iterations, and the final optimality gap. These additions will make the scale of the reductions and their dependence on instance size explicit. revision: yes

Circularity Check

0 steps flagged

No circularity: claims rest on computational experiments with standard cutting-plane methods

full rationale

The paper presents an algorithmic framework that applies the well-established cutting-plane method (dynamic subtour constraint generation plus arc preprocessing) to TSP, then evaluates it via classical ILP, direct D-Wave annealing, and hybrid solvers. No equations, uniqueness theorems, fitted parameters renamed as predictions, or self-citation load-bearing steps appear in the provided text. The central claims are empirical performance improvements measured on benchmark instances; these are falsifiable by re-running the experiments and do not reduce to any definitional identity or self-referential loop. The derivation chain is therefore self-contained and external to the reported results.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper relies on the standard TSP subtour-elimination requirement and the established D-Wave quantum-annealing framework; no new free parameters, axioms, or invented entities are introduced in the abstract.

axioms (1)
  • domain assumption A valid TSP tour requires subtour elimination constraints to prevent disconnected cycles.
    Abstract identifies this as the major modeling challenge addressed by the iterative approach.

pith-pipeline@v0.9.0 · 5454 in / 1234 out tokens · 25727 ms · 2026-05-10T00:34:44.807162+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

135 extracted references · 18 canonical work pages · 1 internal anchor

  1. [1]

    International Conference on Optimization and Decision Science , pages=

    Last-mile deliveries by using drones and classical vehicles , author=. International Conference on Optimization and Decision Science , pages=. 2017 , organization=

    2017

  2. [2]

    Transportation Research Part C: Emerging Technologies , volume=

    Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming , author=. Transportation Research Part C: Emerging Technologies , volume=. 2018 , publisher=

    2018

  3. [3]

    Mathematical programming , volume=

    Models and algorithms for a staff scheduling problem , author=. Mathematical programming , volume=. 2003 , publisher=

    2003

  4. [4]

    Scientific reports , volume=

    Application of quantum annealing to nurse scheduling problem , author=. Scientific reports , volume=. 2019 , publisher=

    2019

  5. [5]

    The International Conference on Smart Manufacturing, Industrial & Logistics Engineering (SMILE) , pages=

    Quantum Computing Approaches to Optimize Employee Scheduling in Multi-task Call Centers , author=. The International Conference on Smart Manufacturing, Industrial & Logistics Engineering (SMILE) , pages=. 2023 , organization=

    2023

  6. [6]

    2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) , pages=

    Practical effectiveness of Quantum Annealing for shift scheduling problem , author=. 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) , pages=. 2022 , organization=

    2022

  7. [7]

    A tutorial , author=

    Modeling staff scheduling problems. A tutorial , author=. European Journal of Operational Research , volume=. 2004 , publisher=

    2004

  8. [8]

    European journal of operational research , volume=

    Staff scheduling and rostering: A review of applications, methods and models , author=. European journal of operational research , volume=. 2004 , publisher=

    2004

  9. [9]

    , author=

    Nurse scheduling models: a state-of-the-art review. , author=. Journal of the Society for Health Systems , volume=

  10. [10]

    , author=

    Continuous personnel scheduling algorithms: a literature review. , author=. Journal of the Society for Health Systems , volume=

  11. [11]

    Computers & Industrial Engineering , volume=

    Integrated days off and shift personnel scheduling , author=. Computers & Industrial Engineering , volume=. 1985 , publisher=

    1985

  12. [12]

    European journal of operational research , volume=

    Personnel scheduling: Models and complexity , author=. European journal of operational research , volume=. 2011 , publisher=

    2011

  13. [13]

    Flexible Shift Planning in the Service Industry: The Case of Physicians in Hospitals , pages=

    Literature review on personnel scheduling , author=. Flexible Shift Planning in the Service Industry: The Case of Physicians in Hospitals , pages=. 2010 , publisher=

    2010

  14. [14]

    Journal of the ACM , volume=

    Integer programming formulation of traveling salesman problems , author=. Journal of the ACM , volume=

  15. [15]

    SIAM Review , volume=

    A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems , author=. SIAM Review , volume=

  16. [16]

    The Traveling Salesman Problem: A Computational Study , author=

  17. [17]

    Operations Research , volume=

    An effective heuristic algorithm for the traveling-salesman problem , author=. Operations Research , volume=

  18. [18]

    Computers & Operations Research , volume =

    Routing and Scheduling of Vehicles and Crews: The State of the Art , author =. Computers & Operations Research , volume =. 1983 , doi =

    1983

  19. [19]

    New Insights on the Multistage Insertion Formulation of the Traveling Salesman Problem: Polytopes, Algorithms, and Experiments , author =

  20. [20]

    European Journal of Operational Research , volume =

    The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms , author =. European Journal of Operational Research , volume =. 1992 , doi =

    1992

  21. [21]

    Optimal Campaign Visitation of Presidential Aspirants: Case Study of the Central Region of Ghana , author =

  22. [22]

    Psychometrika , volume =

    Applications of Combinatorial Programming to Data Analysis: The Traveling Salesman and Related Problems , author =. Psychometrika , volume =. 1978 , doi =

    1978

  23. [23]

    Operations Research and Decision Aid Methodologies in Traffic and Transportation Management , pages=

    Recent advances in routing algorithms , author=. Operations Research and Decision Aid Methodologies in Traffic and Transportation Management , pages=. 1998 , publisher=

    1998

  24. [24]

    Journal of the Operational Research Society , volume =

    A Concise Guide to the Traveling Salesman Problem , author =. Journal of the Operational Research Society , volume =. 2010 , doi =

    2010

  25. [25]

    50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art , pages=

    Fifty-plus years of combinatorial integer programming , author=. 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art , pages=. 2009 , publisher=

    1958

  26. [26]

    arXiv preprint arXiv:2603.23290 , year=

    Traveling Salesman Problem with a preprocessing method for classical and quantum optimization , author=. arXiv preprint arXiv:2603.23290 , year=

    work page arXiv

  27. [27]

    Graphs, networks and algorithms , pages=

    A hard problem: The tsp , author=. Graphs, networks and algorithms , pages=. 1999 , publisher=

    1999

  28. [28]

    Management Science , volume =

    A Heuristic Approach to Solving Travelling Salesman Problems , author =. Management Science , volume =. 1964 , doi =

    1964

  29. [29]

    Operations Research , volume =

    A Method for Solving Traveling-Salesman Problems , author =. Operations Research , volume =. 1958 , doi =

    1958

  30. [30]

    Proceedings of the American Mathematical Society , year =

    On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem , author =. Proceedings of the American Mathematical Society , year =

  31. [31]

    Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme , author =

  32. [32]

    Numerische Mathematik , volume =

    A Note on Two Problems in Connexion with Graphs , author =. Numerische Mathematik , volume =

  33. [33]

    Mathematical Programming , volume =

    On the Symmetric Travelling Salesman Problem II: Lifting Theorems and Facets , author =. Mathematical Programming , volume =. 1979 , doi =

    1979

  34. [34]

    1972 , doi =

    Reducibility Among Combinatorial Problems , author =. 1972 , doi =

    1972

  35. [35]

    Wiley-Interscience Series in Discrete Mathematics , year=

    The traveling salesman problem: a guided tour of combinatorial optimization , author=. Wiley-Interscience Series in Discrete Mathematics , year=

  36. [36]

    Classification of Traveling Salesman Problem Formulations , author =

  37. [37]

    Mathematical Programming , volume =

    Integer Programming Approaches to the Travelling Salesman Problem , author =. Mathematical Programming , volume =. 1976 , doi =

    1976

  38. [38]

    Solving the resource constrained project scheduling problem with quantum annealing , journal =

    P. Solving the resource constrained project scheduling problem with quantum annealing , journal =. 2024 , volume =. doi:10.1038/s41598-024-67168-6 , url =

    work page doi:10.1038/s41598-024-67168-6 2024

  39. [39]

    arXiv preprint arXiv:2503.24285 , year=

    Advanced Quantum Annealing Approach to Vehicle Routing Problems with Time Windows , author=. arXiv preprint arXiv:2503.24285 , year=

    work page arXiv

  40. [40]

    Proceedings of the Genetic and Evolutionary Computation Conference Companion , pages=

    Hybrid quantum-classical heuristic for the bin packing problem , author=. Proceedings of the Genetic and Evolutionary Computation Conference Companion , pages=

  41. [41]

    arXiv preprint arXiv:2207.07460 , year=

    Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem , author=. arXiv preprint arXiv:2207.07460 , year=

    work page arXiv

  42. [42]

    International Conference on Emerging Trends and Technologies on Intelligent Systems , pages=

    Logistics network optimization using quantum annealing , author=. International Conference on Emerging Trends and Technologies on Intelligent Systems , pages=. 2023 , organization=

    2023

  43. [43]

    Phillipson, Quantum Computing in Logistics and Supply Chain Management an Overview (2024), arXiv:2402.17520 [quant-ph]

    Quantum computing in logistics and supply chain management an overview , author=. arXiv preprint arXiv:2402.17520 , year=

    work page arXiv

  44. [44]

    arXiv preprint arXiv:2511.02696 , year=

    Resource-efficient variational quantum solver for the travelling salesman problem and its silicon photonics implementation , author=. arXiv preprint arXiv:2511.02696 , year=

    work page arXiv

  45. [45]

    Quantum Information Processing , year =

    Review of the application of quantum annealing-related technologies in transportation optimization , author =. Quantum Information Processing , year =

  46. [46]

    Entropy , volume =

    Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem , author =. Entropy , volume =. 2023 , doi =

    2023

  47. [47]

    IEEE Access , volume =

    A Systematic Literature Review of Quantum Computing for Routing Problems , author =. IEEE Access , volume =. 2022 , doi =

    2022

  48. [48]

    SN Computer Science , volume =

    Optimizing the Production of Test Vehicles Using Hybrid Constrained Quantum Annealing , author =. SN Computer Science , volume =. 2022 , doi =

    2022

  49. [49]

    arXiv preprint arXiv:2509.20127 , year=

    A Comparison of Quadratic and Higher-Order Representations for QAOA , author=. arXiv preprint arXiv:2509.20127 , year=

    work page arXiv

  50. [50]

    Benchmarks and Hybrid Algorithms in Optimization and Applications , pages=

    Qoptlib: a quantum computing oriented benchmark for combinatorial optimization problems , author=. Benchmarks and Hybrid Algorithms in Optimization and Applications , pages=. 2023 , publisher=

    2023

  51. [51]

    arXiv preprint arXiv:2306.08507

    Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors , author=. arXiv preprint arXiv:2306.08507 , year=

    work page arXiv

  52. [52]

    ACM Computing Surveys , volume =

    Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study , author =. ACM Computing Surveys , volume =. 2023 , doi =

    2023

  53. [53]

    IEEE Transactions on Intelligent Transportation Systems , volume =

    Quantum Path Integral Approach for Vehicle Routing Optimization With Limited Qubit , author =. IEEE Transactions on Intelligent Transportation Systems , volume =. 2024 , doi =

    2024

  54. [54]

    2021 , doi =

    Error Mitigation for Variational Quantum Algorithms through Mid-Circuit Measurements , author =. 2021 , doi =

    2021

  55. [55]

    arXiv preprint arXiv:2405.03054 , year=

    A Greedy Quantum Route-Generation Algorithm , author=. arXiv preprint arXiv:2405.03054 , year=

    work page arXiv

  56. [56]

    Job shop scheduling solver based on quantum annealing , author=. Proc. of ICAPS-16 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling (COPLAS) , pages=

  57. [57]

    Lerzan Örmeci and F

    E. Lerzan Örmeci and F. Sibel Salman and Eda Yücel , keywords =. Staff rostering in call centers providing employee transportation , journal =. 2014 , issn =. doi:https://doi.org/10.1016/j.omega.2013.06.003 , url =

    work page doi:10.1016/j.omega.2013.06.003 2014

  58. [58]

    European Journal of Industrial Engineering , volume=

    Operator staffing and scheduling for an IT-help call centre , author=. European Journal of Industrial Engineering , volume=. 2007 , publisher=

    2007

  59. [59]

    Future Generation Computer Systems , volume=

    Quantum annealing for the two-level facility location problem , author=. Future Generation Computer Systems , volume=. 2026 , publisher=

    2026

  60. [60]

    2025 IEEE International Conference on Quantum Computing and Engineering (QCE) , volume=

    Quantum-Assisted Automatic Path-Planning for Robotic Quality Inspection in Industry 4.0 , author=. 2025 IEEE International Conference on Quantum Computing and Engineering (QCE) , volume=. 2025 , organization=

    2025

  61. [61]

    Proceedings of the Genetic and Evolutionary Computation Conference Companion , pages=

    Steiner Traveling Salesman Problem with Quantum Annealing , author=. Proceedings of the Genetic and Evolutionary Computation Conference Companion , pages=

  62. [62]

    Frontiers in Physics , volume =

    Jain, Siddharth , title =. Frontiers in Physics , volume =. 2021 , doi =

    2021

  63. [63]

    , title =

    Warren, Richard H. , title =. arXiv preprint arXiv:2106.05948 , year =

    work page arXiv

  64. [64]

    Quantum Computing for Discrete Optimization: A Highlight of Three Technologies , journal =

    Bochkarev, Alexey and Heese, Raoul and J. Quantum Computing for Discrete Optimization: A Highlight of Three Technologies , journal =. 2026 , doi =

    2026

  65. [65]

    Philosophical Transactions of the Royal Society A , volume=

    Quantum annealing: An overview , author=. Philosophical Transactions of the Royal Society A , volume=. 2023 , publisher=

    2023

  66. [66]

    Reports on Progress in Physics , volume=

    Perspectives of quantum annealing: Methods and implementations , author=. Reports on Progress in Physics , volume=. 2020 , publisher=

    2020

  67. [67]

    D-Wave Systems Inc., Tech

    Measuring performance of the leap constrained quadratic model solver , author=. D-Wave Systems Inc., Tech. Rep , year=

  68. [68]

    arXiv preprint arXiv:2303.15419 , year=

    A CQM-based approach to solving a combinatorial problem with applications in drug design , author=. arXiv preprint arXiv:2303.15419 , year=

    work page arXiv

  69. [69]

    Production engineering , volume=

    Solving flexible job shop scheduling problems in manufacturing with Quantum Annealing , author=. Production engineering , volume=. 2023 , publisher=

    2023

  70. [70]

    50 Years of Integer Programming 1958-2008: from the Early Years to the State-of-the-Art , pages=

    Reducibility among combinatorial problems , author=. 50 Years of Integer Programming 1958-2008: from the Early Years to the State-of-the-Art , pages=. 2009 , publisher=

    1958

  71. [71]

    ORSA journal on computing , volume=

    TSPLIB—A traveling salesman problem library , author=. ORSA journal on computing , volume=. 1991 , publisher=

    1991

  72. [72]

    New Hybrid Solver: Constrained Quadratic Model , year =

  73. [73]

    CQM Solver Parameters , year =

  74. [74]

    Steiner Traveling Salesman Problem with Time Windows and Pickup-Delivery: integrating classical and quantum optimization

    Steiner Traveling Salesman Problem with Time Windows and Pickup-Delivery: integrating classical and quantum optimization , author=. arXiv preprint arXiv:2508.17896 , year=

    work page internal anchor Pith review Pith/arXiv arXiv

  75. [75]

    The traveling salesman problem , year=

    The traveling salesman problem: a computational study , author=. The traveling salesman problem , year=

  76. [76]

    2001 , publisher=

    The traveling salesman: computational solutions for TSP applications , author=. 2001 , publisher=

    2001

  77. [77]

    Proceedings of the London Mathematical Society , volume=

    Some theorems on abstract graphs , author=. Proceedings of the London Mathematical Society , volume=. 1952 , publisher=

    1952

  78. [78]

    Scientific Reports , volume=

    Solving a real-world package delivery routing problem using quantum annealers , author=. Scientific Reports , volume=. 2024 , publisher=

    2024

  79. [79]

    Operations Research Proceedings 2001: Selected Papers of the International Conference on Operations Research (OR 2001) Duisburg, September 3--5, 2001 , pages=

    Routing a fleet of vehicles for dynamic combined pick-up and deliveries services , author=. Operations Research Proceedings 2001: Selected Papers of the International Conference on Operations Research (OR 2001) Duisburg, September 3--5, 2001 , pages=. 2002 , organization=

    2001

  80. [80]

    arXiv preprint arXiv:2504.01560 , year=

    Optimizing Package Delivery with Quantum Annealers: Addressing Time-Windows and Simultaneous Pickup and Delivery , author=. arXiv preprint arXiv:2504.01560 , year=

    work page arXiv

Showing first 80 references.