{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:41:53Z","timestamp":1775018513619,"version":"3.50.1"},"reference-count":55,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1134\/s0032946025020036","type":"journal-article","created":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T14:46:01Z","timestamp":1759761961000},"page":"110-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Technique for Transforming Discrete Optimization Problems into QUBO Form"],"prefix":"10.1134","volume":"61","author":[{"given":"A. M.","family":"Semenov","sequence":"first","affiliation":[]},{"given":"S. R.","family":"Usmanov","sequence":"additional","affiliation":[]},{"given":"A. K.","family":"Fedorov","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2025,10,6]]},"reference":[{"issue":"1","key":"5118_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10479-014-1687-2","volume":"239","author":"J.A. Castillo-Salazar","year":"2014","unstructured":"Castillo-Salazar, J.A., Landa-Silva, D., and Qu, R., Workforce Scheduling and Routing Problems: Literature Survey and Computational Study, Ann. Oper. Res., 2014, vol.\u00a0239, no.\u00a01, pp.\u00a039\u201367. https:\/\/doi.org\/10.1007\/s10479-014-1687-2","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"5118_CR2","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1145\/358141.358144","volume":"26","author":"S.A. Cook","year":"1983","unstructured":"Cook, S.A., An Overview of Computational Complexity, Comm. ACM, 1983, vol.\u00a026, no.\u00a06, pp.\u00a0400\u2013408. https:\/\/doi.org\/10.1145\/358141.358144","journal-title":"Comm. ACM"},{"key":"5118_CR3","doi-asserted-by":"publisher","unstructured":"Arora, R.K., Optimization: Algorithms and Applications, New York: Chapman & Hall\/CRC, 2015. https:\/\/doi.org\/10.1201\/b18469","DOI":"10.1201\/b18469"},{"key":"5118_CR4","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.neucom.2022.10.075","volume":"518","author":"Y. Tian","year":"2023","unstructured":"Tian, Y., Zhu, W., Zhang, X., and Jin, Y., A Practical Tutorial on Solving Optimization Problems via PlatEMO, Neurocomputing, 2023, vol.\u00a0518, pp.\u00a0190\u2013205. https:\/\/doi.org\/10.1016\/j.neucom.2022.10.075","journal-title":"Neurocomputing"},{"key":"5118_CR5","unstructured":"Fedorov, A.K., Gisin, N., Beloussov, S.M., and Lvovsky, A.I., Quantum Computing at the Quantum Advantage Threshold: A Down-to-Business Review, https:\/\/arXiv.org\/abs\/2203.17181 [quant-ph], 2022."},{"issue":"7","key":"5118_CR6","doi-asserted-by":"publisher","first-page":"10288","DOI":"10.1364\/OE.27.010288","volume":"27","author":"E.S. Tiunov","year":"2019","unstructured":"Tiunov, E.S., Ulanov, A.E., and Lvovsky, A.I., Annealing by Simulating the Coherent Ising Machine, Opt. Express, 2019, vol.\u00a027, no.\u00a07, pp.\u00a010288\u201310295. https:\/\/doi.org\/10.1364\/OE.27.010288","journal-title":"Opt. Express"},{"key":"5118_CR7","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., and Sipser, M., Quantum Computation by Adiabatic Evolution, https:\/\/arXiv.org\/abs\/quant-ph\/0001106, 2000."},{"issue":"3","key":"5118_CR8","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1103\/RevModPhys.80.1061","volume":"80","author":"A. Das","year":"2008","unstructured":"Das, A. and Chakrabarti, B.K., Colloquium: Quantum Annealing and Analog Quantum Computation, Rev. Mod. Phys., 2008, vol.\u00a080, no.\u00a03, pp.\u00a01061\u20131081. https:\/\/doi.org\/10.1103\/RevModPhys.80.1061","journal-title":"Rev. Mod. Phys."},{"issue":"1","key":"5118_CR9","doi-asserted-by":"publisher","first-page":"015002","DOI":"10.1103\/RevModPhys.90.015002","volume":"90","author":"T. Albash","year":"2018","unstructured":"Albash, T. and Lidar, D.A., Adiabatic Quantum Computation, Rev. Mod. Phys., 2018, vol.\u00a090, no.\u00a01, p.\u00a0015002 (64\u00a0pp.). https:\/\/doi.org\/10.1103\/RevModPhys.90.015002","journal-title":"Rev. Mod. Phys."},{"key":"5118_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2021.02.021","volume":"863","author":"J. McCollum","year":"2021","unstructured":"McCollum, J. and Krauss, T., QUBO Formulations of the Longest Path Problem, Theor. Comput. Sci., 2021, vol.\u00a0863, pp.\u00a086\u2013101. https:\/\/doi.org\/10.1016\/j.tcs.2021.02.021","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"5118_CR11","doi-asserted-by":"publisher","first-page":"224","DOI":"10.3390\/a12110224","volume":"12","author":"C. Papalitsas","year":"2019","unstructured":"Papalitsas, C., Andronikos, T., Giannakis, K., Theocharopoulou, G., and Fanarioti, S., A QUBO Model for the Traveling Salesman Problem with Time Windows, Algorithms, 2019, vol.\u00a012, no.\u00a011, p.\u00a0224 (21\u00a0pp.). https:\/\/doi.org\/10.3390\/a12110224","journal-title":"Algorithms"},{"issue":"2","key":"5118_CR12","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.ejor.2006.12.068","volume":"186","author":"B. Alidaee","year":"2008","unstructured":"Alidaee, B., Kochenberger, G., Lewis, K., and Wang, H., A New Approach for Modeling and Solving Set Packing Problems, European J. Oper. Res., 2008, vol.\u00a0186, no.\u00a02, pp.\u00a0504\u2013512. https:\/\/doi.org\/10.1016\/j.ejor.2006.12.068","journal-title":"European J. Oper. Res."},{"key":"5118_CR13","doi-asserted-by":"publisher","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., and Pelillo, M., The Maximum Clique Problem, Handbook of Combinatorial Optimization: Supplement Volume A, Du,\u00a0D.-Z. and Pardalos,\u00a0P.M., Eds., Boston, MA: Springer, 1999, pp.\u00a01\u201374. https:\/\/doi.org\/10.1007\/978-1-4757-3023-4_1","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"5118_CR14","unstructured":"Lloyd, S., Mohseni, M., and Rebentrost, P., Quantum Algorithms for Supervised and Unsupervised Machine Learning, https:\/\/arXiv.org\/abs\/1307.0411v2 [quant-ph], 2013."},{"key":"5118_CR15","doi-asserted-by":"publisher","first-page":"10029","DOI":"10.1038\/s41598-021-89461-4","volume":"11","author":"P. Date","year":"2021","unstructured":"Date, P., Arthur, D., and Pusey-Nazzaro, L., QUBO Formulations for Training Machine Learning Models, Sci. Rep., 2021, vol.\u00a011, p.\u00a010029 (10\u00a0pp.). https:\/\/doi.org\/10.1038\/s41598-021-89461-4","journal-title":"Sci. Rep."},{"key":"5118_CR16","unstructured":"Farhi, E. and Neven, H., Classification with Quantum Neural Networks on Near Term Processors, https:\/\/arXiv.org\/abs\/1802.06002 [quant-ph], 2018."},{"key":"5118_CR17","doi-asserted-by":"publisher","first-page":"1092065","DOI":"10.3389\/fphy.2022.1092065","volume":"10","author":"A.S. Boev","year":"2022","unstructured":"Boev, A.S., Usmanov, S.R., Semenov, A.M., Ushakova, M.M., Salahov, G.V., Mastiukova, A.S., Kiktenko, E.O., and Fedorov, A.K., Quantum-Inspired Optimization for Wavelength Assignment, Front. Phys., 2022, vol.\u00a010, p.\u00a01092065 (11\u00a0pp.). https:\/\/doi.org\/10.3389\/fphy.2022.1092065","journal-title":"Front. Phys."},{"issue":"2","key":"5118_CR18","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1080\/24725854.2023.2193835","volume":"56","author":"O. \u015eeker","year":"2024","unstructured":"\u015eeker, O., Bodur, M., and Pouya, H., Routing and Wavelength Assignment with Protection: A Quadratic Unconstrained Binary Optimization Approach Enabled by Digital Annealer Technology, IISE Trans., 2024, vol.\u00a056, no.\u00a02, pp.\u00a0156\u2013171. https:\/\/doi.org\/10.1080\/24725854.2023.2193835","journal-title":"IISE Trans."},{"key":"5118_CR19","doi-asserted-by":"publisher","unstructured":"Rahman, M.T., Han, S., Tadayon, N., and Valaee, S., Ising Model Formulation of Outlier Rejection, with Application in WiFi Based Positioning, in Proc. 2019 IEEE Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP 2019), Brighton, UK, May\u00a012\u201317, 2019, pp.\u00a04405\u20134409. https:\/\/doi.org\/10.1109\/ICASSP.2019.8683807","DOI":"10.1109\/ICASSP.2019.8683807"},{"issue":"23","key":"5118_CR20","doi-asserted-by":"publisher","first-page":"12288","DOI":"10.3390\/app122312288","volume":"12","author":"J. Lang","year":"2022","unstructured":"Lang, J., Zielinski, S., and Feld, S., Strategic Portfolio Optimization Using Simulated, Digital, and Quantum Annealing, Appl. Sci., 2022, vol.\u00a012, no.\u00a023, p.\u00a012288 (20\u00a0pp.). https:\/\/doi.org\/10.3390\/app122312288","journal-title":"Appl. Sci."},{"key":"5118_CR21","doi-asserted-by":"publisher","unstructured":"Phillipson, F. and Bhatia, H.S., Portfolio Optimisation Using the D-Wave Quantum Annealer, Proc. 21st Int. Conf. on Computational Science (ICCS 2021), Krakow, Poland, June\u00a016\u201318, 2021, Part\u00a0VI, Paszynski,\u00a0M., Kranzlm\u00fcller,\u00a0D., Krzhizhanovskaya,\u00a0V.V., Dongarra,\u00a0J.J., and Sloot,\u00a0P.M.A., Eds., Lect. Notes Comp. Sci., vol.\u00a012747, Berlin, Heidelberg: Springer-Verlag, 2021, pp.\u00a045\u201359. https:\/\/doi.org\/10.1007\/978-3-030-77980-1_4","DOI":"10.1007\/978-3-030-77980-1_4"},{"issue":"1","key":"5118_CR22","doi-asserted-by":"publisher","first-page":"013006","DOI":"10.1103\/PhysRevResearch.4.013006","volume":"4","author":"S. Mugel","year":"2022","unstructured":"Mugel, S., Kuchkovsky, C., S\u00e1nchez, E., Fern\u00e1ndez-Lorenzo, S., Luis-Hita, J., Lizaso, E., and Or\u00fas, R., Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks, Phys. Rev. Res., 2022, vol.\u00a04, no.\u00a01, p.\u00a0013006 (12\u00a0pp.). https:\/\/doi.org\/10.1103\/PhysRevResearch.4.013006","journal-title":"Phys. Rev. Res."},{"key":"5118_CR23","unstructured":"Ratke, D., List of QUBO Formulations, June\u00a02021, https:\/\/blog.xa0.de\/post\/List-of-QUBO-formulations\/ (accessed Feb.\u00a020, 2025)."},{"key":"5118_CR24","unstructured":"Leap User Documentation Handbook, D-Wave Systems Inc., 2025. https:\/\/docs.dwavequantum.com\/en\/latest\/index.html (accessed Mar.\u00a020, 2025)."},{"issue":"1","key":"5118_CR25","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G. Kochenberger","year":"2014","unstructured":"Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., L\u00fc, Z., Wang, H., and Wang, Y., The Unconstrained Binary Quadratic Programming Problem: A Survey, J.\u00a0Comb. Optim., 2014, vol.\u00a028, no.\u00a01, pp.\u00a058\u201381. https:\/\/doi.org\/10.1007\/s10878-014-9734-0","journal-title":"J. Comb. Optim."},{"key":"5118_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A. Lucas","year":"2014","unstructured":"Lucas, A., Ising Formulations of Many NP Problems, Front. Phys., 2014, vol.\u00a02, p.\u00a05 (15\u00a0pp.). https:\/\/doi.org\/10.3389\/fphy.2014.00005","journal-title":"Front. Phys."},{"issue":"1","key":"5118_CR27","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10479-022-04634-2","volume":"314","author":"F. Glover","year":"2022","unstructured":"Glover, F., Kochenberger, G., Hennig, R., and Du, Y., Quantum Bridge Analytics I: A Tutorial on Formulating and Using QUBO Models, Ann. Oper. Res., 2022, vol.\u00a0314, no.\u00a01, pp.\u00a0141\u2013183. https:\/\/doi.org\/10.1007\/s10479-022-04634-2","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"5118_CR28","doi-asserted-by":"publisher","first-page":"283","DOI":"10.3390\/math10020283","volume":"10","author":"M. Asghari","year":"2022","unstructured":"Asghari, M., Fathollahi-Fard, A.M., Mirzapour Al-e-hashem, S.M.J., and Dulebenets, M.A., Transformation and Linearization Techniques in Optimization: A State-of-the-Art Survey, Mathematics, 2022, vol.\u00a010, no.\u00a02, p.\u00a0283 (26\u00a0pp.). https:\/\/doi.org\/10.3390\/math10020283","journal-title":"Mathematics"},{"key":"5118_CR29","doi-asserted-by":"publisher","first-page":"1443977","DOI":"10.3389\/fphy.2024.1443977","volume":"12","author":"E.R. Castro","year":"2024","unstructured":"Castro, E.R., Martins, E.O., Sarthour, R.S., Souza, A.M., and Oliveira, I.S., Improving the Convergence of an Iterative Algorithm for Solving Arbitrary Linear Equation Systems Using Classical or Quantum Binary Optimization, Front. Phys., 2024, vol.\u00a012, p.\u00a01443977 (12\u00a0pp.). https:\/\/doi.org\/10.3389\/fphy.2024.1443977","journal-title":"Front. Phys."},{"issue":"8","key":"5118_CR30","doi-asserted-by":"publisher","first-page":"e0273709","DOI":"10.1371\/journal.pone.0273709","volume":"17","author":"M.T. Veszeli","year":"2021","unstructured":"Veszeli, M.T. and Vattay, G., Mean Field Approximation for Solving QUBO Problems, PLoS ONE, 2021, vol.\u00a017, no.\u00a08, p.\u00a0e0273709 (12\u00a0pp.). https:\/\/doi.org\/10.1371\/journal.pone.0273709","journal-title":"PLoS ONE"},{"key":"5118_CR31","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1038\/s42005-022-00929-9","volume":"5","author":"T. Kanao","year":"2022","unstructured":"Kanao, T. and Goto, H., Simulated Bifurcation Assisted by Thermal Fluctuation, Commun. Phys., 2022, vol.\u00a05, p.\u00a0153 (7\u00a0pp.). https:\/\/doi.org\/10.1038\/s42005-022-00929-9","journal-title":"Commun. Phys."},{"issue":"5","key":"5118_CR32","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1109\/T-C.1971.223306","volume":"20","author":"M. Drubin","year":"1971","unstructured":"Drubin, M., Kronecker Product Factorization of the FFT Matrix, IEEE Trans. Comput., 1971, vol.\u00a020, no.\u00a05, pp.\u00a0590\u2013593. https:\/\/doi.org\/10.1109\/T-C.1971.223306","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"5118_CR33","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF01321860","volume":"19","author":"P. Frolkovi\u010d","year":"1990","unstructured":"Frolkovi\u010d, P., Numerical Recipes: The Art of Scientific Computing, Acta Appl. Math., 1990, vol.\u00a019, no.\u00a03, pp.\u00a0297\u2013299. https:\/\/doi.org\/10.1007\/BF01321860","journal-title":"Acta Appl. Math."},{"issue":"2","key":"5118_CR34","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.cam.2003.10.010","volume":"167","author":"A.N. Langville","year":"2004","unstructured":"Langville, A.N. and Stewart, W.J., The Kronecker Product and Stochastic Automata Networks, J.\u00a0Comput. Appl. Math., 2004, vol.\u00a0167, no.\u00a02, pp.\u00a0429\u2013447. https:\/\/doi.org\/10.1016\/j.cam.2003.10.010","journal-title":"J. Comput. Appl. Math."},{"key":"5118_CR35","unstructured":"Guo, C. and Berkhahn, F., Entity Embeddings of Categorical Variables, https:\/\/arXiv.org\/abs\/1604.06737 [cs.LG], 2016."},{"issue":"1\u20132","key":"5118_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C.J. Alpert","year":"1995","unstructured":"Alpert, C.J. and Kahng, A.B., Recent Directions in Netlist Partitioning: A Survey, Integration, 1995, vol.\u00a019, no.\u00a01\u20132, pp.\u00a01\u201381. https:\/\/doi.org\/10.1016\/0167-9260(95)00008-4.","journal-title":"Integration"},{"issue":"10","key":"5118_CR37","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","volume":"15","author":"F. Barahona","year":"1999","unstructured":"Barahona, F., On the Computational Complexity of Ising Spin Glass Models, J.\u00a0Phys. A: Math. Gen., 1999, vol.\u00a015, no.\u00a010, pp.\u00a03241\u20133253. https:\/\/doi.org\/10.1088\/0305-4470\/15\/10\/028","journal-title":"J. Phys. A: Math. Gen."},{"issue":"8","key":"5118_CR38","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2002","unstructured":"Shi, J. and Malik, J., Normalized Cuts and Image Segmentation, IEEE Trans. Pattern Anal. Mach. Intell., 2002, vol.\u00a022, no.\u00a08, pp.\u00a0888\u2013905. https:\/\/doi.org\/10.1109\/34.868688","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1\u20133","key":"5118_CR39","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01585766","volume":"68","author":"D. Bienstock","year":"1995","unstructured":"Bienstock, D. and G\u00fcnl\u00fck, O., Computational Experience with a Difficult Mixed-Integer Multicommodity Flow Problem, Math. Program., 1995, vol.\u00a068, no.\u00a01\u20133, pp.\u00a0213\u2013237. https:\/\/doi.org\/10.1007\/BF01585766","journal-title":"Math. Program."},{"issue":"6","key":"5118_CR40","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., and Williamson, D.P., Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, J.\u00a0ACM, 1995, vol.\u00a042, no.\u00a06, pp.\u00a01115\u20131145. https:\/\/doi.org\/10.1145\/227683.227684.","journal-title":"J. ACM"},{"issue":"2","key":"5118_CR41","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S. Burer","year":"2002","unstructured":"Burer, S., Monteiro, R.D.C., and Zhang, Y., Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs, SIAM J. Optim., 2002, vol.\u00a012, no.\u00a02, pp.\u00a0503\u2013521. https:\/\/doi.org\/10.1137\/S1052623400382467.","journal-title":"SIAM J. Optim."},{"issue":"2","key":"5118_CR42","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794","volume":"56","author":"S. Arora","year":"2004","unstructured":"Arora, S., Rao, S., and Vazirani, U., Expander Flows, Geometric Embeddings and Graph Partitioning, J.\u00a0ACM, 2004, vol.\u00a056, no.\u00a02, Article No.\u00a05 (37\u00a0pp.) https:\/\/doi.org\/10.1145\/1502793.1502794","journal-title":"J. ACM"},{"key":"5118_CR43","doi-asserted-by":"publisher","unstructured":"Even, G., Medina, M., and Ron, D., Distributed Maximum Matching in Bounded Degree Graphs, in Proc. 16th Int. Conf. on Distributed Computing and Networking (ICDCN\u201915), Goa, India, Jan.\u00a04\u20137, 2015, Article No.\u00a018 (10\u00a0pp.). https:\/\/doi.org\/10.1145\/2684464.2684469","DOI":"10.1145\/2684464.2684469"},{"key":"5118_CR44","doi-asserted-by":"publisher","unstructured":"Karp, R.M., Reducibility Among Combinatorial Problems, Complexity of Computer Computations: Proc. Symp. held March 20\u201322, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, Miller,\u00a0R.E. and Thatcher,\u00a0J.W., Eds., New York: Plenum, 1972, pp.\u00a085\u2013103. https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"3","key":"5118_CR45","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"P.M. Pardalos","year":"1994","unstructured":"Pardalos, P.M. and Xue, J., The Maximum Clique Problem, J.\u00a0Glob. Optim., 1994, vol.\u00a04, no.\u00a03, pp.\u00a0301\u2013328. https:\/\/doi.org\/10.1007\/BF01098364","journal-title":"J. Glob. Optim."},{"key":"5118_CR46","doi-asserted-by":"crossref","unstructured":"Bondy, J.A. and Murty, U.S.R., Graph Theory, London: Springer, 2008.","DOI":"10.1007\/978-1-84628-970-5"},{"key":"5118_CR47","doi-asserted-by":"publisher","unstructured":"Jung, M., Krumke, S.O., Schroth, C., Lobe, E., and Mauerer, W., QCEDA: Using Quantum Computers for EDA, Embedded Computer Systems: Architectures, Modeling, and Simulation (Proc. 24th Int. Conf. SAMOS 2024), Samos, Greece, June\u00a029 \u2013 July\u00a04, 2024, Part\u00a0II, Carro,\u00a0L., Regazzoni,\u00a0F., and Pilato,\u00a0C., Eds., Lect. Notes Comput. Sci., vol.\u00a015227, Cham: Springer, 2025, pp.\u00a032\u201346. https:\/\/doi.org\/10.1007\/978-3-031-78380-7_3","DOI":"10.1007\/978-3-031-78380-7_3"},{"issue":"2","key":"5118_CR48","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"E.M. Loiola","year":"2007","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., and Querido, T., A Survey of the Quadratic Assignment Problem, European J. Oper. Res., 2007, vol.\u00a0176, no.\u00a02, pp.\u00a0657\u2013690. https:\/\/doi.org\/10.1016\/j.ejor.2005.09.032","journal-title":"European J. Oper. Res."},{"issue":"9","key":"5118_CR49","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P. Galinier","year":"2006","unstructured":"Galinier, P. and Hertz, A. A Survey of Local Search Methods for Graph Coloring, Comput. Oper. Res., 2006, vol.\u00a033, no.\u00a09, pp.\u00a02547\u20132562. https:\/\/doi.org\/10.1016\/j.cor.2005.07.028","journal-title":"Comput. Oper. Res."},{"key":"5118_CR50","doi-asserted-by":"publisher","unstructured":"Kellerer, H., Pferschy, U., and Pisinger, D., Knapsack Problems, Berlin\/Heidelberg: Springer, 2004. https:\/\/doi.org\/10.1007\/978-3-540-24777-7","DOI":"10.1007\/978-3-540-24777-7"},{"key":"5118_CR51","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K. Braekers","year":"2015","unstructured":"Braekers, K., Ramaekers, K., and Van Nieuwenhuyse, I., The Vehicle Routing Problem: State of the Art Classification and Review, Comput. Ind. Eng., 2015, vol.\u00a099, pp.\u00a0300\u2013313. https:\/\/doi.org\/10.1016\/j.cie.2015.12.007","journal-title":"Comput. Ind. Eng."},{"key":"5118_CR52","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2021.3049230","volume":"2","author":"S. Harwood","year":"2021","unstructured":"Harwood, S., Gambella, C., Trenev, D., Simonetto, A., Bernal Neira, D., and Greenberg, D., Formulating and Solving Routing Problems on Quantum Computers, IEEE Trans. Quantum Eng., 2021, vol.\u00a02, Article No.\u00a03100118 (17\u00a0pp.). https:\/\/doi.org\/10.1109\/TQE.2021.3049230","journal-title":"IEEE Trans. Quantum Eng."},{"key":"5118_CR53","unstructured":"Reinelt, G., TSPLIB (online library), 1995. Available at http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/."},{"key":"5118_CR54","doi-asserted-by":"publisher","unstructured":"McDonald, R., A Study of Global Inference Algorithms in Multi-document Summarization, Advances in Information Retrieval: Proc. 29th European Conf. on IR Research, ECIR 2007, Rome, Italy, Apr.\u00a02\u20135, 2007, Amati,\u00a0G., Carpineto,\u00a0C., and Romano,\u00a0G., Eds., Lect. Notes Comput. Sci., vol.\u00a04425, Berlin\/Heidelberg: Springer, 2007, pp.\u00a0557\u2013564. https:\/\/doi.org\/10.1007\/978-3-540-71496-5_51","DOI":"10.1007\/978-3-540-71496-5_51"},{"issue":"2","key":"5118_CR55","doi-asserted-by":"publisher","first-page":"48","DOI":"10.7868\/S3034583925020041","volume":"61","author":"A.M. Semenov","year":"2025","unstructured":"Semenov, A.M., Usmanov, S.R., and Fedorov, A.K., Reducing Discrete Optimization Problems to the QUBO Form, Probl. Peredachi Inf., 2025, vol.\u00a061, no.\u00a02, pp.\u00a048\u201365. https:\/\/doi.org\/10.7868\/S3034583925020041","journal-title":"Probl. Peredachi Inf."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946025020036.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946025020036","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946025020036.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:53:01Z","timestamp":1775011981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946025020036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["5118"],"URL":"https:\/\/doi.org\/10.1134\/s0032946025020036","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]},"assertion":[{"value":"3 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this work declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}