{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:05:06Z","timestamp":1778594706134,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10479-022-04695-3","type":"journal-article","created":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T18:02:42Z","timestamp":1651514562000},"page":"185-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange"],"prefix":"10.1007","volume":"314","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6945-0438","authenticated-orcid":false,"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary","family":"Kochenberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moses","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,2]]},"reference":[{"issue":"1","key":"4695_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/net.3230080107","volume":"8","author":"AA Assad","year":"1978","unstructured":"Assad, A. A. (1978). Multicommodity network flows\u2014A survey. Networks, 8(1), 37\u201391.","journal-title":"Networks"},{"key":"4695_CR3","first-page":"250","volume-title":"Extremal methods and systems analysis","author":"R Barr","year":"1978","unstructured":"Barr, R., Elam, J., Glover, F., & Klingman, D. (1978). A network augmenting path basis algorithm for transshipment problems. In A. Fiacco & K. Kortanek (Eds.), Extremal methods and systems analysis (pp. 250\u2013274). Springer."},{"key":"4695_CR4","unstructured":"Du, Y., Kochenberger, G., Glover, F., Lu, Z. P., Liu, D. H., & Hulandageri, A. (2020). Optimal solutions to the minimum sum coloring problem: A comparison of alternative models. Working Paper, University of Colorado Denver."},{"key":"4695_CR100","unstructured":"Du, Y., Glover, F., Kochenberger, G., Hennig, R., Lu, Z., & Wang, H. (2022). Metaheuristics vs. Exact Solvers: Finding Optimal Solutions to the Minimum Sum Coloring Problem, working paper."},{"key":"4695_CR5","unstructured":"Fitzpatrick, L. (2019). A complete beginner\u2019s guide to atomic swaps. Forbes. Retrieved September 2, 2019, from https:\/\/www.forbes.com\/sites\/lukefitzpatrick"},{"key":"4695_CR6","volume-title":"Flows in networks","author":"DR Fulkerson","year":"1962","unstructured":"Fulkerson, D. R., & Ford, L. R., Jr. (1962). Flows in networks. Rand Corporation."},{"key":"4695_CR7","doi-asserted-by":"crossref","unstructured":"Glover, F., Klingman, D., & Phillips, N. (1992) Network models in optimization and their applications in practice. Wiley Interscience, Wiley.","DOI":"10.1002\/9781118033173"},{"key":"4695_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F Glover","year":"1996","unstructured":"Glover, F. (1996). Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics, 65, 223\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"4695_CR9","first-page":"12","volume-title":"Mathematical programming study","author":"F Glover","year":"1986","unstructured":"Glover, F., Glover, R., & Klingman, D. (1986). The threshold assignment algorithm. In G. Gallo & C. Sandi (Eds.), Mathematical programming study (Vol. 26, pp. 12\u201337). Springer."},{"key":"4695_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10288-019-00424-y","volume":"17","author":"F Glover","year":"2021","unstructured":"Glover, F., Kochenberger, G., & Du, Y. (2021a). Quantum Bridge Analytics I: A tutorial on formulating and using QUBO methods. 4OR Quarterly Journal of Operations Research, 17, 335\u2013371.","journal-title":"4OR Quarterly Journal of Operations Research"},{"key":"4695_CR11","volume-title":"The quadratic unconstrained binary optimization problem","author":"F Glover","year":"2021","unstructured":"Glover, F., Kochenberger, G., & Du, Y. (2021b). Applications and computational advances for solving the QUBO model. In A. P. Punnen (Ed.), The quadratic unconstrained binary optimization problem. Springer."},{"issue":"4","key":"4695_CR12","first-page":"335","volume":"17","author":"F Glover","year":"2022","unstructured":"Glover, F., Kochenberger, G., Hennig, R., & Du, Y. (2022). Quantum Bridge Analytics I: A tutorial on formulating and using QUBO methods. Annuals of Operations Research, 17(4), 335\u2013371.","journal-title":"Annuals of Operations Research."},{"key":"4695_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10288-020-00464-9","volume":"18","author":"F Glover","year":"2020","unstructured":"Glover, F., Kochenberger, G., Ma, M., & Du, Y. (2020). Quantum Bridge Analytics II: Combinatorial chaining for asset exchange. 4OR Quarterly Journal of Operations Research, 18, 387\u2013417.","journal-title":"4OR Quarterly Journal of Operations Research"},{"key":"4695_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Springer."},{"issue":"2018","key":"4695_CR15","first-page":"829","volume":"265","author":"F Glover","year":"2017","unstructured":"Glover, F., Lewis, M., & Kochenberger, G. (2017). Logical and inequality implications for reducing the size and difficulty of unconstrained binary optimization problems. European Journal of Operational Research, 265(2018), 829\u2013842.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4695_CR16","first-page":"7","volume":"20","author":"F Glover","year":"1990","unstructured":"Glover, F., Phillips, N., & Klingman, D. (1990). Netform modeling and applications. Special Issue on the Practice of Mathematical Programming, Interfaces, 20(1), 7\u201327.","journal-title":"Special Issue on the Practice of Mathematical Programming, Interfaces"},{"issue":"3","key":"4695_CR17","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.ejor.2019.03.030","volume":"277","author":"O Guemri","year":"2019","unstructured":"Guemri, O., Nduwayoa, P., Todosijevic, R., Hanafi, S., & Glover, F. (2019). Probabilistic Tabu search for the cross-docking assignment problem. European Journal of Operational Research, 277(3), 875\u2013885.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4695_CR18","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K. (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1), 106\u2013130.","journal-title":"European Journal of Operational Research"},{"issue":"2\u20133","key":"4695_CR19","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun, K. (2009). \u201cGeneral k-opt submoves for the Lin-Kernighan TSP heuristic. Mathematical Programming Computation, 1(2\u20133), 119\u2013163.","journal-title":"Mathematical Programming Computation"},{"issue":"2","key":"4695_CR20","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/2076450.2076469","volume":"55","author":"H Hoos","year":"2012","unstructured":"Hoos, H. (2012). Programming by optimization. Communications of the ACM, 55(2), 70\u201380.","journal-title":"Communications of the ACM"},{"key":"4695_CR21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.344","author":"TC Hu","year":"1963","unstructured":"Hu, T. C. (1963). Multi-commodity network flows. INFORMS PubsOnline. https:\/\/doi.org\/10.1287\/opre.11.3.344","journal-title":"INFORMS PubsOnline"},{"key":"4695_CR22","doi-asserted-by":"crossref","unstructured":"Kubicka, E., & Schwenk, A. J. (1989). An introduction to chromatic sums. In CSC\u201989 : Proceedings of the 17th conference on ACM annual computer science conference (pp. 39\u201345). ACM.","DOI":"10.1145\/75427.75430"},{"key":"4695_CR23","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s00186-016-0555-z","volume":"85","author":"JC M\u00fcller","year":"2017","unstructured":"M\u00fcller, J. C., Pokutta, S., Martin, A., Pape, S., Peter, A., & Winter, T. (2017). Pricing and clearing combinatorial markets with singleton and swap orders. Mathematical Methods of Operations Research, 85, 155\u2013177.","journal-title":"Mathematical Methods of Operations Research"},{"key":"4695_CR1","doi-asserted-by":"publisher","unstructured":"National Academies. (2019). The National Academies of Sciences, Engineering and Medicine. In Quantum computing: Progress and prospects. The National Academies Press. https:\/\/doi.org\/10.17226\/25196.","DOI":"10.17226\/25196"},{"key":"4695_CR24","unstructured":"Nolan, T. (2013). Alt chains and atomic transfers. Bitcointalk. https:\/\/bitcointalk.org\/index.php?topic=193281.0"},{"issue":"1","key":"4695_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/net.21676","volume":"68","author":"C Rego","year":"2016","unstructured":"Rego, C., Gamboa, D., & Glover, F. (2016). Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem. Networks: Special Issue on Metaheuristics in Network Optimization, 68(1), 23\u201333.","journal-title":"Networks: Special Issue on Metaheuristics in Network Optimization"},{"issue":"4","key":"4695_CR26","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10288-006-0029-x","volume":"4","author":"C Rego","year":"2006","unstructured":"Rego, C., & Glover, F. (2006). Ejection chain and filter-and-fan methods in combinatorial optimization. 4OR: Quarterly Journal of Operations Research, 4(4), 263\u2013296.","journal-title":"4OR: Quarterly Journal of Operations Research"},{"key":"4695_CR27","doi-asserted-by":"crossref","unstructured":"Resende, M. G. C., Ribeiro, C. C., Glover, F., & R. Mart\u00ed, R. (2010). Scatter search and path relinking: Fundamentals, advances and applications. In Handbook of metaheuristics: International series in operations research & management science (Vol. 146, pp. 87\u2013107). Springer.","DOI":"10.1007\/978-1-4419-1665-5_4"},{"key":"4695_CR28","doi-asserted-by":"crossref","unstructured":"Samorani, M., Wang, Y., Lu, Z., & Glover, F. (2019). Clustering-driven evolutionary algorithms: an application of path relinking to the QUBO problem. In F. Glover and M. Samorani (Eds.), Special issue on intensification, diversification and learning of the Journal of Heuristics (Vol. 25, Issue 4\u20135, pp. 629\u2013642). Springer.","DOI":"10.1007\/s10732-018-9403-z"},{"issue":"3","key":"4695_CR29","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.ejor.2012.07.012","volume":"223","author":"Y Wang","year":"2012","unstructured":"Wang, Y., Lu, Z., Glover, F., & Hao, J.-K. (2012). Path relinking for unconstrained binary quadratic programming. European Journal of Operational Research, 223(3), 595\u2013604.","journal-title":"European Journal of Operational Research"},{"key":"4695_CR30","unstructured":"Winter, T., Rudel, M., Lalla, H., Brendgen, S., Gei\u00dfler, B., Martin, A., & Morsi, A. (2011). System and method for performing an opening auction of a derivative. US Patent App. 12\/618,410, Pub. No.: US 2011\/0119170 A1. https:\/\/www.google.de\/patents\/US20110119170"},{"key":"4695_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1019149101850","volume":"8","author":"J Xu","year":"1997","unstructured":"Xu, J., Chiu, S., & Glover, F. (1997). Tabu search for dynamic routing communications network design. Telecommunications Systems, 8, 1\u201323.","journal-title":"Telecommunications Systems"},{"key":"4695_CR33","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.ejor.2004.08.015","volume":"169","author":"M Yagiura","year":"2006","unstructured":"Yagiura, M., Ibaraki, T., & Glover, F. (2006). A path relinking approach with ejection chains for the generalized assignment problem. European Journal of Operational Research, 169, 548\u2013569.","journal-title":"European Journal of Operational Research"},{"key":"4695_CR32","doi-asserted-by":"crossref","unstructured":"Yagiura, M., Komiya, A., Kojima, K., Nonobe, K., Nagamochi, H., Ibaraki, T., & Glover, F. (2007). A path relinking approach for the multi-resource generalized quadratic assignment problem. In Lecture notes in computer science (Vol. 4638, pp. 121\u2013135). Springer.","DOI":"10.1007\/978-3-540-74446-7_9"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04695-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-04695-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04695-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T12:34:25Z","timestamp":1744202065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-04695-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["4695"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-04695-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,2]]},"assertion":[{"value":"21 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}