Copertina

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Vodeb, Jaka, Eržen, Vid, Hrga, Timotej, Povh, Janez
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Quantum Physics 68Q12, 90C27, 90C26, 90C59
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
di: Quintero, Rodolfo A., et al.
Pubblicazione: (2024)

A Canceling Heuristic for the Directed Traveling Salesman Problem
di: Borgwardt, Steffen, et al.
Pubblicazione: (2026)

Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms
di: Halffmann, Pascal, et al.
Pubblicazione: (2024)

Kinetic description and convergence analysis of genetic algorithms for global optimization
di: Borghi, Giacomo, et al.
Pubblicazione: (2023)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
di: Im, Haesol, et al.
Pubblicazione: (2024)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
di: Geremew, W., et al.
Pubblicazione: (2026)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
di: Qu, Zheng, et al.
Pubblicazione: (2023)

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

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

Kurdyka-Łojasiewicz exponent via square transformation
di: Ouyang, Wenqing
Pubblicazione: (2025)

Nature-Inspired Algorithms in Optimization: Introduction, Hybridization and Insights
di: Yang, Xin-She
Pubblicazione: (2023)

Metaheuristic algorithms for the induced P-median problem with upgrades
di: Salazar, Sergio, et al.
Pubblicazione: (2026)

Constrained Consensus-Based Optimization and Numerical Heuristics for the Few Particle Regime
di: Beddrich, Jonas, et al.
Pubblicazione: (2024)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
di: Yang, Dominic, et al.
Pubblicazione: (2025)

An ODE approach to multiple choice polynomial programming
di: Shao, Sihong, et al.
Pubblicazione: (2022)

Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest $k$-Subgraph Problem
di: Bihani, Omkar, et al.
Pubblicazione: (2025)

Quantum computing and the stable set problem
di: Krpan, Aljaž, et al.
Pubblicazione: (2024)

A solution procedure for minimizing total completion time in a parallel-batching environment
di: Alfieri, Arianna, et al.
Pubblicazione: (2020)

Applying a Random-Key Optimizer on Mixed Integer Programs
di: Chaves, Antonio A., et al.
Pubblicazione: (2026)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
di: Kim, Junyoung, et al.
Pubblicazione: (2024)

Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks
di: Heinz, Vilém, et al.
Pubblicazione: (2025)

Real-time solution of quadratic optimization problems with banded matrices and indicator variables
di: Gomez, Andres, et al.
Pubblicazione: (2024)

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

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

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
di: Lara, Felipe, et al.
Pubblicazione: (2024)

Performance Estimation of second-order optimization methods on classes of univariate functions
di: Rubbens, Anne, et al.
Pubblicazione: (2025)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
di: Mohammadisiahroudi, Mohammadhossein, et al.
Pubblicazione: (2023)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
di: Halbig, Katrin, et al.
Pubblicazione: (2024)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
di: Dörfler, Daniel, et al.
Pubblicazione: (2020)

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

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
di: Jung, Woosuk L., et al.
Pubblicazione: (2023)

Policy Optimization over General State and Action Spaces
di: Ju, Caleb, et al.
Pubblicazione: (2022)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
di: Borges, Jennifer C., et al.
Pubblicazione: (2026)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
di: da Silva, Renan F. F., et al.
Pubblicazione: (2023)

Tractable downfall of basis pursuit in structured sparse optimization
di: Marmary, Maya V., et al.
Pubblicazione: (2025)

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

Conductance Estimation in Digraphs: Submodular Transformation, Lovász Extension and Dinkelbach Iteration
di: Shao, Sihong, et al.
Pubblicazione: (2025)

Quadratic Programming over Linearly Ordered Fields: Decidability and Attainment of Optimal Solutions
di: Plutenko, Dmytro O.
Pubblicazione: (2026)

Optimization with Trained Machine Learning Models Embedded
di: Schweidtmann, Artur M., et al.
Pubblicazione: (2022)