IDEAS home Printed from https://ideas.repec.org/a/wly/jjmath/v2025y2025i1n3201094.html

QUBO Modeling for a Spectrum of Domination Problems

Author

Listed:
  • Haoqian Pan
  • Changhong Lu

Abstract

As quantum computing advances, the application of quantum algorithms to address combinatorial optimization problems on quantum computers has emerged as a pivotal area of research. The quadratic unconstrained binary optimization (QUBO) acts as an intermediary, facilitating the translation of combinatorial optimization problems into a quantum computing context, thereby constituting an essential foundation for this field of inquiry. Within the realm of combinatorial optimization, the domination problem (DP) is pertinent to a myriad of real‐world applications, including, but not limited to, the strategic placement of fire stations and the analysis of social network structures. Furthermore, the DP encompasses a multitude of variants, exemplified by the independent DP, total DP, and k‐domination, among others. However, a dearth of research exists within the quantum computing community regarding these variant problems. One plausible explanation for this gap is the absence of comprehensive QUBO modeling research pertaining to these issues. This paper delves into the methodologies of QUBO modeling for both the canonical DP and its diverse variants. For the classic DP, we have refined the existing QUBO modeling methods, addressing the issue of incomplete modeling. Additionally, we have optimized the variable representation of the slack terms in the penalty items of DP. At the same time, we introduce novel QUBO modeling methods for a spectrum of DP variants, marking a pioneering effort in this domain. Our contributions are anticipated to expedite the integration of DP into the burgeoning quantum computing landscape.

Suggested Citation

  • Haoqian Pan & Changhong Lu, 2025. "QUBO Modeling for a Spectrum of Domination Problems," Journal of Mathematics, John Wiley & Sons, vol. 2025(1).
    • Handle: RePEc:wly:jjmath:v:2025:y:2025:i:1:n:3201094
    DOI: 10.1155/jom/3201094
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/jom/3201094
    Download Restriction: no
    File URL: https://libkey.io/10.1155/jom/3201094?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Fred Glover & Gary Kochenberger & Rick Hennig & Yu Du, 2022. "Quantum bridge analytics I: a tutorial on formulating and using QUBO models," Annals of Operations Research, Springer, vol. 314(1), pages 141-183, July.
    2. Richard M. Karp, 2010. "Reducibility Among Combinatorial Problems," Springer Books, in: Michael Jünger & Thomas M. Liebling & Denis Naddef & George L. Nemhauser & William R. Pulleyblank & (ed.), 50 Years of Integer Programming 1958-2008, chapter 0, pages 219-241, Springer.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vivek Katial & Kate Smith-Miles & Charles Hill & Lloyd Hollenberg, 2025. "On the Instance Dependence of Parameter Initialization for the Quantum Approximate Optimization Algorithm: Insights via Instance Space Analysis," INFORMS Journal on Computing, INFORMS, vol. 37(1), pages 146-171, January.
    2. Xunzhao Yin & Yu Qian & Alptekin Vardar & Marcel Günther & Franz Müller & Nellie Laleni & Zijian Zhao & Zhouhang Jiang & Zhiguo Shi & Yiyu Shi & Xiao Gong & Cheng Zhuo & Thomas Kämpfe & Kai Ni, 2024. "Ferroelectric compute-in-memory annealer for combinatorial optimization problems," Nature Communications, Nature, vol. 15(1), pages 1-11, December.
    3. Creemers, Stefan & Armas, Luis Fernando Pérez, 2025. "Discrete optimization: A quantum revolution?," European Journal of Operational Research, Elsevier, vol. 323(2), pages 378-408.
    4. Marco Antonio Boschetti & Vittorio Maniezzo, 2024. "Contemporary approaches in matheuristics an updated survey," Annals of Operations Research, Springer, vol. 343(2), pages 663-700, December.
    5. Fu, Jun & Sun, Xiaojie & Zhang, Peng & Findeisen, Rolf, 2026. "Exploring diverse solutions in network dismantling with generative model," Chaos, Solitons & Fractals, Elsevier, vol. 202(P2).
    6. Qian Hui & Tiandong Wang, 2025. "Systemic Risk Management via Maximum Independent Set in Extremal Dependence Networks," Papers 2503.15534, arXiv.org.
    7. Fan, Tianlong & Jiang, Wenjun & Zhang, Yi-Cheng & Lü, Linyuan, 2025. "A fast maximum clique algorithm based on network decomposition for large sparse networks," Chaos, Solitons & Fractals, Elsevier, vol. 194(C).
    8. Samuel Deleplanque & Luis Fernando Pérez Armas & Stefan Creemers, 2025. "solQHealer: Quantum Procedures for Rendering Infeasible Solutions Feasible: A Proof of Concept with the Maximum Independent Set Problem and 3-SAT," Journal of Heuristics, Springer, vol. 31(3), pages 1-28, September.
    9. Abbas, Amira & Ambainis, Andris & Augustino, Brandon & Baertschi, Andreas & Buhrman, Harry & Coffrin, Carleton & Cortiana, Giorgio & Dunjko, Vedran & Egger, Daniel J. & Elmegreen, Bruce G. & Franco, N, 2024. "Challenges and opportunities in quantum optimization," Other publications TiSEM eb4b8a22-9322-4251-8802-9, Tilburg University, School of Economics and Management.
    10. Fu, Wei & Xie, Haipeng & Xin, Yu, 2026. "Quantum-accelerated post-event restoration through quantum surrogate absolute-value Lagrangian relaxation," Reliability Engineering and System Safety, Elsevier, vol. 266(PA).
    11. Wang, Miao & Li, Feng & Xu, Zhou & Yang, Xianyan & Wang, Julong, 2026. "Order selection and fulfillment integration with flexible products," Omega, Elsevier, vol. 138(C).
    12. Zongji Li & Tobias Seidel & Dominik Leib & Michael Bortz & Raoul Heese, 2025. "Efficient solution of the number partitioning problem on a quantum annealer: a hybrid quantum-classical decomposition approach," Journal of Heuristics, Springer, vol. 31(2), pages 1-20, June.
    13. Samuel Deleplanque & Luis Fernando Pérez Armas & Stefan Creemers, 2025. "solQHealer: Quantum Procedures for Rendering Infeasible Solutions Feasible: A Proof of Concept with the Maximum Independent Set Problem and 3-SAT," Post-Print hal-05204085, HAL.
    14. Tinish Bhattacharya & George H. Hutchinson & Giacomo Pedretti & Xia Sheng & Jim Ignowski & Thomas Vaerenbergh & Ray Beausoleil & John Paul Strachan & Dmitri B. Strukov, 2024. "Computing high-degree polynomial gradients in memory," Nature Communications, Nature, vol. 15(1), pages 1-11, December.
    15. Bochkarev, Alexey & Heese, Raoul & Jäger, Sven & Schiewe, Philine & Schöbel, Anita, 2026. "Quantum computing for discrete optimization: A highlight of three technologies," European Journal of Operational Research, Elsevier, vol. 329(3), pages 747-766.
    16. Chen, Zhiwei & Xu, Yufei & Peeta, Srinivas, 2025. "Deep learning-based travel choice prediction with provable and adaptable fairness guarantees," Transportation Research Part B: Methodological, Elsevier, vol. 200(C).
    17. Dick den Hertog & Jean Pauphilet & Yannick Pham & Bruno Sainte-Rose & Baizhi Song, 2025. "Optimizing the Path Towards Plastic-Free Oceans," Operations Research, INFORMS, vol. 73(3), pages 1165-1183, May.
    18. Fred Glover & Gary Kochenberger & Moses Ma & Yu Du, 2022. "Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange," Annals of Operations Research, Springer, vol. 314(1), pages 185-212, July.
    19. Petra Maria Bartmeyer & Christiano Lyra, 2025. "On the benefits of a new continuous reformulation for QUBO problems," Annals of Operations Research, Springer, vol. 351(1), pages 653-665, August.
    20. Shaposhnik, Yaron, 2025. "A dual-index rule for managing temporary congestion," European Journal of Operational Research, Elsevier, vol. 323(1), pages 34-44.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jjmath:v:2025:y:2025:i:1:n:3201094. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/1469 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.