Imagen de Portada

A Copositive Framework for Analysis of Hybrid Ising-Classical Algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Brown, Robin, Neira, David E. Bernal, Venturelli, Davide, Pavone, Marco
Formato:	Preprint
Publicado:	2022
Materias:	Optimization and Control Discrete Mathematics Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Accelerating Continuous Variable Coherent Ising Machines via Momentum
por: Brown, Robin, et al.
Publicado: (2024)

Quantum algorithms for optimizers
por: Nannicini, Giacomo
Publicado: (2024)

Solving General QUBOs with Warm-Start QAOA via a Reduction to Max-Cut
por: Bhattacharyya, Bikrant, et al.
Publicado: (2025)

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
por: Li, Zongji, et al.
Publicado: (2023)

Normalizations of factorizations over convex cones and their effects on extension complexity
por: Brown, Adam, et al.
Publicado: (2025)

Combinatorial Algorithm for Tropical Linearly Factorized Programming
por: Nishida, Yuki
Publicado: (2025)

A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
por: Thomas, Helen, et al.
Publicado: (2025)

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
por: Kar, Prem Nigam, et al.
Publicado: (2024)

Parallel Token Swapping for Qubit Routing
por: Bansal, Ishan, et al.
Publicado: (2024)

Recommend-to-Match with Random Supply Rejections: Formulation, Approximation, and Analysis
por: Liu, Haoyue, et al.
Publicado: (2025)

On Supportedness in Multi-Objective Combinatorial Optimization
por: Könen, David, et al.
Publicado: (2025)

Polytopes of alternating sign matrices with dihedral-subgroup symmetry
por: Madarasi, Péter
Publicado: (2026)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
por: Bangerter, Elise, et al.
Publicado: (2026)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
por: Lozano, Leonardo, et al.
Publicado: (2022)

A review of minimum cost box searching games
por: Lidbetter, Thomas
Publicado: (2025)

A Knowledge Compilation Take on Binary Polynomial Optimization
por: Capelli, Florent, et al.
Publicado: (2023)

A Tight Formulation for the Dial-a-Ride Problem
por: Gaul, Daniela, et al.
Publicado: (2023)

A parallel pull labelling algorithm for the resource constrained shortest path problem
por: Petersen, Bjørn, et al.
Publicado: (2025)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
por: Fouilhoux, Pierre, et al.
Publicado: (2024)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
por: Vercesi, Eleonora, et al.
Publicado: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
por: Alidaee, Bahram, et al.
Publicado: (2024)

A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
por: Ketkov, Sergey S.
Publicado: (2023)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
por: Proença, Nathan Benedetto, et al.
Publicado: (2026)

Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set
por: Wu, Yikai, et al.
Publicado: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
por: Del Pia, Alberto, et al.
Publicado: (2022)

Rank-one Boolean tensor factorization and the multilinear polytope
por: Del Pia, Alberto, et al.
Publicado: (2022)

Minimum Cut Representability of Stable Matching Problems
por: Faenza, Yuri, et al.
Publicado: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
por: Moldenhauer, Carsten, et al.
Publicado: (2025)

Geoffrion's theorem beyond finiteness and rationality
por: Dey, Santanu S., et al.
Publicado: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
por: Wang, Changjun, et al.
Publicado: (2026)

On the Virtual Network Embedding polytope
por: Benhamiche, Amal, et al.
Publicado: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
por: Jabbari-Marand, Behnam, et al.
Publicado: (2026)

Shortest Paths in Graphs of Convex Sets
por: Marcucci, Tobia, et al.
Publicado: (2021)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
por: Bernardelli, Ambrogio Maria, et al.
Publicado: (2024)

Order acceptance and scheduling in capacitated job shops
por: Linß, Florian, et al.
Publicado: (2024)

Market proliferation and the impact of locational complexity on network restructuring
por: Pinar-Pérez, J. M., et al.
Publicado: (2024)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
por: Swamy, Rahul, et al.
Publicado: (2024)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
por: Del Pia, Alberto
Publicado: (2025)

An exact approach for the multi-depot electric vehicle scheduling problem
por: Haslinger, Xenia, et al.
Publicado: (2025)

Factorized binary polynomial optimization
por: Del Pia, Alberto
Publicado: (2024)