VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • QUBO Relaxations and Iterative Algorithms for the Sparsest k-Subgraph Problem [Elektronski vir] : version v1
    Bihani, Omkar Narayan ...
    This work introduces three Quadratic Unconstrained Binary Optimization (QUBO) relaxations for the sparsest k-subgraph (SkS) problem: a quadratic penalty relaxation, a Lagrangian relaxation, and an ... augmented Lagrangian relaxation. We provide theoretical results identifying the ranges of penalty parameters that ensure exactness of the relaxations. Building on these results, we design three iterative algorithms that update penalty parameters dynamically and approximately solve the internal QUBO problems using simulated annealing and quantum processing units (QPUs). Numerical experiments confirm the theoretical guarantees and showcase the efficiency of the proposed algorithms in practice.
    Vrsta gradiva - raziskovalni podatki ; neleposlovje za odrasle
    Založništvo in izdelava - Genève : Zenodo, 2025
    Jezik - angleški
    COBISS.SI-ID - 250745347

    Povezava(-e):

    https://zenodo.org/records/17086045
    DOI

Vnos na polico