Cover Image

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Subiñas, Sergio Muñiz, Martín, Jorge Martínez, Ali, Alejandro Mata, Sedano, Javier, García-Vico, Ángel Miguel
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Emerging Technologies 68Q25, 90C27, 15A69
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tensor-Network Formulation of the Traveling Salesman Problem and Variants
by: Ali, Alejandro Mata, et al.
Published: (2023)

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

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

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

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

Quantum-inspired Tensor Network for QUBO, QUDO and Tensor QUDO Problems with k-neighbors
by: Subiñas, Sergio Muñiz, et al.
Published: (2026)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2026)

A semidefinite programming characterization of the Crawford number
by: Friedland, Shmuel, et al.
Published: (2024)

Integral Biflow Maximization
by: Ding, Guoli, et al.
Published: (2024)

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

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
by: Liu, Bowen
Published: (2025)

Tensors, entanglement, separability, and their complexity
by: Friedland, Shmuel
Published: (2025)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
by: Friedland, Shmuel
Published: (2023)

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

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
by: Chiarelli, Nina, et al.
Published: (2023)

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

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
by: Gupta, Swati, et al.
Published: (2026)

The General Position Problem: A Survey
by: V., Ullas Chandran S., et al.
Published: (2025)

On semidefinite programming characterizations of the numerical radius and its dual norm
by: Friedland, Shmuel, et al.
Published: (2023)

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

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
by: Bergougnoux, Benjamin, et al.
Published: (2025)

HaTT: Hadamard avoiding TT recompression
by: Sun, Zhonghao, et al.
Published: (2024)

Topological structure and a polynomial-time solution of linear programming over the real numbers
by: Wei, Jing-Yuan
Published: (2018)

A non-iterative polynomial algorithm for linear programming
by: Jing-Yuan, Wei
Published: (2013)

Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints
by: Schwardt, J., et al.
Published: (2025)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)

Formal Foundations for Controlled Stochastic Activity Networks
by: Movaghar, Ali
Published: (2025)

A Quantum Computing Approach for the Unit Commitment Problem
by: Halffmann, Pascal, et al.
Published: (2022)

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

Prime Factorization Equation from a Tensor Network Perspective
by: Ali, Alejandro Mata, et al.
Published: (2025)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2026)

The n-vehicle exploration problem is NP-complete
by: Cui, Jinchuan, et al.
Published: (2023)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
by: Bousselmi, Nizar, et al.
Published: (2023)

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

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

Shortest Paths in a Weighted Simplicial Complex
by: Chakraborty, Sukrit, et al.
Published: (2025)