Cover Image

Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ali, Alejandro Mata, Delgado, Iñigo Perez, Markaida, Beatriz García, de Leceta, Aitor Moreno Fdez.
Format:	Preprint
Published:	2023
Subjects:	Quantum Physics Emerging Technologies 68Q12, 15A69, 90C27 G.1.3; G.2.1
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)

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

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

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

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

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

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

Solving Systems of Linear Equations: HHL from a Tensor Networks Perspective
by: Ali, Alejandro Mata, 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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Design of General Purpose Minimal-Auxiliary Ising Machines
by: Martin, Isaac K., et al.
Published: (2023)

A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
by: Ryabchenko, Alexander, et al.
Published: (2026)

QUBO Resolution of the Job Reassignment Problem
by: Delgado, Iñigo Perez, et al.
Published: (2023)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

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

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

Leveraging Multi-Instance GPUs through moldable task scheduling
by: Villarrubia, Jorge, et al.
Published: (2025)

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

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

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

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

Constrained Portfolio Optimization via Quantum Approximate Optimization Algorithm (QAOA) with XY-Mixers and Trotterized Initialization: A Hybrid Approach for Direct Indexing
by: Mancilla, Javier, et al.
Published: (2026)

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

EOSpython Version 0.0.11: A Framework for Scenario Generation and a Solution System for the Agile Earth Observation Satellite Scheduling Problem
by: Vasegaard, Alex Elkjær, et al.
Published: (2024)

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

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
by: Chen, Yijia, et al.
Published: (2023)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)