Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems

Documenti analoghi

• Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
  di: Arima, Naohiko, et al.
  Pubblicazione: (2024)
• On exactness of SDP relaxation for the maximum cut problem
  di: Bhardwaj, Avinash, et al.
  Pubblicazione: (2025)
• Separable QCQPs and Their Exact SDP Relaxations
  di: Kojima, Masakazu, et al.
  Pubblicazione: (2026)
• Constructing QCQP Instances Equivalent to Their SDP Relaxations
  di: Kojima, Masakazu, et al.
  Pubblicazione: (2025)
• Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
  di: Yildirim, E. Alper
  Pubblicazione: (2025)