Grover Adaptive Search-Based Hybrid Benders Decomposition for Mixed-Integer Linear Programs
Mixed-integer linear programs are widely used to model optimization problems involving both discrete and continuous variables, but remain computationally challenging due to the combinatorial complexity. To exploit the potential advantages of quantum computing in tackling the combinatorial optimizati...
Kaydedildi:
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
IEEE
2026-01-01
|
| Seri Bilgileri: | IEEE Transactions on Quantum Engineering |
| Konular: | |
| Online Erişim: | https://ieeexplore.ieee.org/document/11475201/ |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|