Copertina

Tensor-Network Formulation of the Traveling Salesman Problem and Variants

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ali, Alejandro Mata, Delgado, Iñigo Perez, de Leceta, Aitor Moreno Fdez.
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Quantum Physics Emerging Technologies 68Q12, 15A69, 90C27, 90B06 G.1.3; G.2.1
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Polynomial-time Solver of Tridiagonal QUBO, QUDO and Tensor QUDO problems with Tensor Networks
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2023)

Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2023)

Introduction to QUDO, Tensor QUDO and HOBO formulations: Qudits, Equivalences, Knapsack Problem, Traveling Salesman Problem and Combinatorial Games
di: Ali, Alejandro Mata
Pubblicazione: (2025)

Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA
di: Ali, Alejandro Mata
Pubblicazione: (2025)

Quantum-inspired Techniques in Tensor Networks for Industrial Contexts
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2024)

A QUBO Formulation for the Generalized LinkedIn Queens and Takuzu/Tango Game
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2024)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
di: Ali, Alejandro Mata
Pubblicazione: (2025)

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
di: Subiñas, Sergio Muñiz, et al.
Pubblicazione: (2025)

Técnicas Quantum-Inspired en Tensor Networks para Contextos Industriales
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2024)

A QUBO Formulation for the Generalized Takuzu/LinkedIn Tango Game
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2024)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

Solving Systems of Linear Equations: HHL from a Tensor Networks Perspective
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2023)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2023)

Hybrid LLM and Higher-Order Quantum Approximate Optimization for CSA Collateral Management
di: Jin, Tao, et al.
Pubblicazione: (2025)

Quantum Annealing and Tensor Networks: a Powerful Combination to Solve Optimization Problems
di: Binimelis, Miquel Albertí
Pubblicazione: (2024)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
di: Emmerich, Michael T. M.
Pubblicazione: (2026)

Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
di: Bärligea, Adelina, et al.
Pubblicazione: (2025)

Investigating Techniques to Optimise the Layout of Turbines in a Windfarm using a Quantum Computer
di: Hancock, James, et al.
Pubblicazione: (2023)

Investigating methods to solve large windfarm optimization problems with a minimum number of qubits using circuit-based quantum computers
di: Hancock, James, et al.
Pubblicazione: (2025)

Quantum walk informed variational algorithm design
di: Matwiejew, Edric, et al.
Pubblicazione: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
di: Hougardy, Stefan, et al.
Pubblicazione: (2024)

A reliability-aware randomized simheuristic for the stochastic team orienteering problem
di: Circelli, Michele
Pubblicazione: (2026)

Measuring diversity. A review and an empirical analysis
di: Parreño, Francisco, et al.
Pubblicazione: (2024)

An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results
di: Pozo, Miguel A., et al.
Pubblicazione: (2022)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
di: Bhadoriya, Abhay Singh, et al.
Pubblicazione: (2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory
di: Warme, David M.
Pubblicazione: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
di: Warme, David M.
Pubblicazione: (2024)

Anomaly Detection from a Tensor Train Perspective
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2024)

Modern column generation for estimating single- and multi-purchase ranked list choice models
di: Costa, Luciano, et al.
Pubblicazione: (2026)

Computational Phase Transitions in Binary Compressed Sensing: Quantum Annealing Inside the Relaxation Gap
di: Hahn, William, et al.
Pubblicazione: (2026)

Quantum Computing, Ising Formulation, and the Traveling Salesman Problem
di: Gurevich, Omer, et al.
Pubblicazione: (2025)

A Restless Bandit Model for Dynamic Ride Matching with Reneging Travelers
di: Fu, Jing, et al.
Pubblicazione: (2021)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
di: Li, Shisheng
Pubblicazione: (2026)

Improved global performance guarantees of second-order methods in convex minimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

An optimally fast objective-function-free minimization algorithm using random subspaces
di: Bellavia, S., et al.
Pubblicazione: (2023)

Barrier Algorithms for Constrained Non-Convex Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
di: Emmerich, Michael T. M., et al.
Pubblicazione: (2026)