Traveling Salesman Problem with a preprocessing method for classical and quantum optimization

• URL: http://arxiv.org/abs/2603.23290v1
• Date: Tue, 24 Mar 2026 14:54:14 GMT
• Title: Traveling Salesman Problem with a preprocessing method for classical and quantum optimization
• Abstract summary: The Traveling Salesman Problem is a fundamental optimization problem widely studied in operations research.<n>Despite its simple formulation, it remains computationally challenging due to the exponential growth of the search space and the large number of constraints.<n>This paper introduces a preprocessing strategy that significantly reduces the size of the optimization model.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Traveling Salesman Problem is a fundamental combinatorial optimization problem widely studied in operations research. Despite its simple formulation, it remains computationally challenging due to the exponential growth of the search space and the large number of constraints required to eliminate subtours. This paper introduces a preprocessing strategy that significantly reduces the size of the optimization model by restricting the set of candidate arcs and retaining only the lowest-cost neighbors for each vertex. Computational experiments on TSPLIB benchmark instances demonstrate that the proposed approach substantially reduces the number of decision variables. The method is evaluated using both classical and quantum optimization techniques, showing improvements in computational time and reductions in optimality gaps. Overall, the results indicate that the proposed preprocessing enhances the scalability of the formulations and makes them more suitable for both classical solvers and emerging quantum optimization frameworks.

Related papers

• Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem [0.0]
  A major challenge in Traveling Salesman Problem is the large number of subtour elimination constraints.<n>We adopt an iterative approach grounded in well-established operations research techniques.<n>We investigate both classical and quantum optimization approaches for solving the problem.
  arXiv  Detail & Related papers  (2026-04-22T08:20:17Z)
• CVaR-Assisted Custom Penalty Function for Constrained Optimization [3.652509571098291]
  Constrained optimization problems are frequently reformulated as quadratic unconstrained binary optimization (QUBO) models.<n>Standard QUBO formulations enforce inequality constraints through slack variables and quadratic penalties.<n>We propose a slack-free penalty formulation for constrained binary optimization that eliminates auxiliary slack variables.
  arXiv  Detail & Related papers  (2026-04-22T01:08:38Z)
• Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization [66.51747366239299]
  We propose a smooth variant of the min-max problem based on the augmented Lagrangian.<n>The proposed algorithm scales better with the number of objectives than subgradient-based strategies.
  arXiv  Detail & Related papers  (2025-03-16T11:05:51Z)
• A Simplification Method for Inequality Constraints in Integer Binary Encoding HOBO Formulations [0.0]
  The proposed method addresses challenges associated with Quadratic Unconstrained Binary Optimization (QUBO) formulations.<n>By efficiently integrating constraints, the method enhances the computational efficiency and accuracy of both quantum and classical solvers.
  arXiv  Detail & Related papers  (2025-01-16T17:06:25Z)
• Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling [96.47086913559289]
  gradient-based algorithms are widely used in bilevel optimization. We introduce a without-replacement sampling based algorithm which achieves a faster convergence rate. We validate our algorithms over both synthetic and real-world applications.
  arXiv  Detail & Related papers  (2024-11-07T17:05:31Z)
• A coherent approach to quantum-classical optimization [0.0]
  Hybrid quantum-classical optimization techniques have been shown to allow for the reduction of quantum computational resources. We identify the coherence entropy as a crucial metric in determining the suitability of quantum states. We propose a quantum-classical optimization protocol that significantly improves on previous approaches for such tasks.
  arXiv  Detail & Related papers  (2024-09-20T22:22:53Z)
• Learning Joint Models of Prediction and Optimization [56.04498536842065]
  Predict-Then-Then framework uses machine learning models to predict unknown parameters of an optimization problem from features before solving. This paper proposes an alternative method, in which optimal solutions are learned directly from the observable features by joint predictive models.
  arXiv  Detail & Related papers  (2024-09-07T19:52:14Z)
• Analyzing and Enhancing the Backward-Pass Convergence of Unrolled Optimization [50.38518771642365]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. A central challenge in this setting is backpropagation through the solution of an optimization problem, which often lacks a closed form. This paper provides theoretical insights into the backward pass of unrolled optimization, showing that it is equivalent to the solution of a linear system by a particular iterative method. A system called Folded Optimization is proposed to construct more efficient backpropagation rules from unrolled solver implementations.
  arXiv  Detail & Related papers  (2023-12-28T23:15:18Z)
• Iterative Layerwise Training for Quantum Approximate Optimization Algorithm [0.39945675027960637]
  The capability of the quantum approximate optimization algorithm (QAOA) in solving the optimization problems has been intensively studied in recent years. We propose the iterative layerwise optimization strategy and explore the possibility for the reduction of optimization cost in solving problems with QAOA.
  arXiv  Detail & Related papers  (2023-09-24T05:12:48Z)
• Backpropagation of Unrolled Solvers with Folded Optimization [55.04219793298687]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. One typical strategy is algorithm unrolling, which relies on automatic differentiation through the operations of an iterative solver. This paper provides theoretical insights into the backward pass of unrolled optimization, leading to a system for generating efficiently solvable analytical models of backpropagation.
  arXiv  Detail & Related papers  (2023-01-28T01:50:42Z)
• Faster Algorithm and Sharper Analysis for Constrained Markov Decision Process [56.55075925645864]
  The problem of constrained decision process (CMDP) is investigated, where an agent aims to maximize the expected accumulated discounted reward subject to multiple constraints. A new utilities-dual convex approach is proposed with novel integration of three ingredients: regularized policy, dual regularizer, and Nesterov's gradient descent dual. This is the first demonstration that nonconcave CMDP problems can attain the lower bound of $mathcal O (1/epsilon)$ for all complexity optimization subject to convex constraints.
  arXiv  Detail & Related papers  (2021-10-20T02:57:21Z)
• Unified Convergence Analysis for Adaptive Optimization with Moving Average Estimator [75.05106948314956]
  We show that an increasing large momentum parameter for the first-order moment is sufficient for adaptive scaling.<n>We also give insights for increasing the momentum in a stagewise manner in accordance with stagewise decreasing step size.
  arXiv  Detail & Related papers  (2021-04-30T08:50:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.