Copertina

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Ali, Alejandro Mata
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Emerging Technologies Quantum Physics 74P99, 81P68, 68R05, 68R10, 90C27, 90C05, 90C10, 90C20, 90C59 F.1.2; F.2.1; F.2.2; G.1.6; G.2.1; G.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
di: Rockel-Wolff, Benjamin
Pubblicazione: (2024)

LOFA: Online Influence Maximization under Full-Bandit Feedback using Lazy Forward Selection
di: Xu, Jinyu, et al.
Pubblicazione: (2026)

How Local Separators Shape Community Structure in Large Networks
di: Frenkel, Sarah, et al.
Pubblicazione: (2025)

An improved approximation algorithm for k-Median
di: Young, Neal E.
Pubblicazione: (2025)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
di: Chimani, Markus, et al.
Pubblicazione: (2021)

A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence
di: Robson, Eliot W., et al.
Pubblicazione: (2025)

Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs
di: Ju, Caleb, et al.
Pubblicazione: (2023)

Simple Approximations for General Spanner Problems
di: Bökler, Fritz, et al.
Pubblicazione: (2025)

Exact Minimum Weight Spanners via Column Generation
di: Bökler, Fritz, et al.
Pubblicazione: (2024)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
di: Alimi, Morteza, et al.
Pubblicazione: (2025)

Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks
di: Dijkstra, Lukas, et al.
Pubblicazione: (2024)

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

The partial gossip problem revisited
di: Kokhas, Konstantin, et al.
Pubblicazione: (2026)

Fractional Budget Allocation for Influence Maximization under General Marketing Strategies
di: Bhimaraju, Akhil, et al.
Pubblicazione: (2024)

Enhancing Model Based Derivative Free Optimization using Direct Search
di: Li, Zijun, et al.
Pubblicazione: (2026)

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
di: Fang, Xiaolei, et al.
Pubblicazione: (2026)

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)

Bicriteria Submodular Maximization
di: Feldman, Moran, et al.
Pubblicazione: (2025)

Designing Capacitated Subnetworks for Shortest Path Routing
di: Chimani, Markus, et al.
Pubblicazione: (2026)

Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks
di: Perron, Cédrick, et al.
Pubblicazione: (2025)

Rich Vehicle Routing Problem in Disaster Management enabling Temporally-causal Transhipments across Multi-Modal Transportation Network
di: Banerjee, Santanu, et al.
Pubblicazione: (2025)

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

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
di: Foos, Josefine, et al.
Pubblicazione: (2023)

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

Approximation algorithms for the prize-collecting rural postman problem
di: Li, Hong, et al.
Pubblicazione: (2026)

Mutually Unbiased Bases for Variational Quantum Initialization: Basis-Union Optimality and Adaptive Family Search
di: Semre, Abed, et al.
Pubblicazione: (2026)

cuGenOpt: A GPU-Accelerated General-Purpose Metaheuristic Framework for Combinatorial Optimization
di: Liu, Yuyang
Pubblicazione: (2026)

Sufficiently Regularized Nonnegative Quartic Polynomials are Sum-of-Squares
di: Zhu, Wenqi, et al.
Pubblicazione: (2026)

A Unified Framework for Automated Assembly Sequence and Production Line Planning using Graph-based Optimization
di: Hartmann, Christoph, et al.
Pubblicazione: (2025)

An Empirical Evaluation of Quantum-Inspired QUBO Methods for Heterogeneous HPC Workflow Mapping and Scheduling
di: Sharma, Aasish Kumar, et al.
Pubblicazione: (2026)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
di: Choi, Mujin, et al.
Pubblicazione: (2025)

Turnpike with Uncertain Measurements: Triangle-Equality ILP with a Deterministic Recovery Guarantee
di: Elder, C. S., et al.
Pubblicazione: (2026)

The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
di: Abbasizanjani, Hoda, et al.
Pubblicazione: (2020)

P vs NP Problem in Portfolio Optimization: Integrating the Markowitz-CAPM Framework with Cardinality Constraints and Black-Scholes Derivative Pricing
di: Gondauri, Davit
Pubblicazione: (2026)

Quickly excluding an annotated planar graph
di: Gorsky, Maximilian, et al.
Pubblicazione: (2026)

The price of homogeneity is polynomial
di: Gorsky, Maximilian, et al.
Pubblicazione: (2026)

Packing, Hitting, and Colouring Squares
di: Caoduro, Marco, et al.
Pubblicazione: (2022)

A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems
di: Babu, Anand, et al.
Pubblicazione: (2026)