{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T17:41:20Z","timestamp":1777657280388,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10288-020-00464-9","type":"journal-article","created":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T09:04:12Z","timestamp":1607331852000},"page":"387-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6945-0438","authenticated-orcid":false,"given":"Fred","family":"Glover","sequence":"first","affiliation":[]},{"given":"Gary","family":"Kochenberger","sequence":"additional","affiliation":[]},{"given":"Moses","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,7]]},"reference":[{"issue":"1","key":"464_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/net.3230080107","volume":"8","author":"AA Assad","year":"1978","unstructured":"Assad AA (1978) Multicommodity network flows\u2014a survey. Networks 8(1):37\u201391","journal-title":"Networks"},{"key":"464_CR2","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: Fiacco A, Kortanek K (eds) Extremal methods and systems analysis. Springer, Berlin, pp 250\u2013274"},{"key":"464_CR3","unstructured":"Du Y, Kochenberger G, Glover F, Lu ZP, Liu DH, Hulandageri A (2020) Optimal solutions to the minimum sum coloring problem: a comparison of alternative models. Working paper, University of Colorado Denver"},{"key":"464_CR4","unstructured":"Fitzpatrick L (2019) A complete beginner\u2019s guide to atomic swaps. Forbes, Sept 2, 2019 https:\/\/www.forbes.com> sites> lukefitzpatrick"},{"key":"464_CR5","volume-title":"Flows in networks","author":"DR Fulkerson","year":"1962","unstructured":"Fulkerson DR, Ford LR Jr (1962) Flows in networks. Rand Corporation, Santa Monica"},{"key":"464_CR6","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 Appl Math 65:223\u2013253","journal-title":"Discrete Appl Math"},{"key":"464_CR7","series-title":"Mathematical programming study","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/BFb0121086","volume-title":"Netflow at Pisa","author":"F Glover","year":"1986","unstructured":"Glover F, Glover R, Klingman D (1986) The threshold assignment algorithm. In: Gallo G, Sandi C (eds) Netflow at Pisa, vol 26. Mathematical programming study. Springer, Berlin, pp 12\u201337"},{"issue":"1","key":"464_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1287\/inte.20.4.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":"Interfaces"},{"key":"464_CR9","series-title":"Wiley Interscience","first-page":"284","volume-title":"Network models in optimization and their applications in practice. Reviewed in interfaces","author":"F Glover","year":"1992","unstructured":"Glover F, Klingman D, Phillips N (1992) Network models in optimization and their applications in practice. Reviewed in interfaces. Wiley Interscience. Wiley, Hoboken, p 284"},{"key":"464_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10288-019-00424-y","volume":"17","author":"F Glover","year":"2019","unstructured":"Glover F, Kochenberger G, Du Y (2019) Quantum bridge analytics I: a tutorial on formulating and using QUBO models. 4OR Q J Oper Res Invited Surv 17:335\u2013371","journal-title":"4OR Q J Oper Res Invited Surv"},{"key":"464_CR11","unstructured":"Glover F, Kochenberger G, Du Y, Hennig R, Wang H, Mniszewski S, Hulandageri A (2020) New advances for solving important classes of combinatorial optimization problems. In: 12th INFORMS conference on information systems and technology (CIST), virtual 2020 INFORMS annual meeting, November 7\u201313"},{"key":"464_CR12","volume-title":"The quadratic unconstrained binary optimization problem","author":"F Glover","year":"2021","unstructured":"Glover F, Kochenberger G, Du Y (2021) Applications of the QUBO Model. In: Punnen AP (ed) The quadratic unconstrained binary optimization problem. Springer, Berlin"},{"issue":"3","key":"464_CR13","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. Eur J Oper Res 277(3):875\u2013885","journal-title":"Eur J Oper Res"},{"issue":"1","key":"464_CR14","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\u2013Kernighan traveling salesman heuristic. Eur J Oper Res 126(1):106\u2013130","journal-title":"Eur J Oper Res"},{"issue":"2\u20133","key":"464_CR15","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) General k-opt submoves for the Lin\u2013Kernighan TSP heuristic. Math Program Comput 1(2\u20133):119\u2013163","journal-title":"Math Program Comput"},{"issue":"2","key":"464_CR16","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. Commun ACM 55(2):70\u201380","journal-title":"Commun ACM"},{"key":"464_CR17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.344","author":"TC Hu","year":"1963","unstructured":"Hu TC (1963) Multi-commodity network flows. Oper Res. https:\/\/doi.org\/10.1287\/opre.11.3.344","journal-title":"Oper Res"},{"key":"464_CR18","unstructured":"Kochenberger G, Ma M (2019) Quantum computing applications of QUBO models to portfolio optimization. White paper. University of Colorado, Denver, September 2019"},{"key":"464_CR19","doi-asserted-by":"crossref","unstructured":"Kubicka E, Schwenk AJ (1989) An introduction to chromatic sums. In: CSC\u201989: proceedings of the 17th conference on ACM annual computer science conference, New York, NY, USA, ACM, pp 39\u201345","DOI":"10.1145\/75427.75430"},{"key":"464_CR20","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 JC, Pokutta S, Martin A, Pape S, Peter A, Winter T (2017) Pricing and clearing combinatorial markets with singleton and swap orders. Math Methods Oper Res 85:155\u2013177","journal-title":"Math Methods Oper Res"},{"key":"464_CR21","doi-asserted-by":"publisher","unstructured":"National Academies (2019) The national academies of sciences, engineering and medicine, 2019, quantum computing: progress and prospects. The National Academies Press, NY https:\/\/doi.org\/10.17226\/25196","DOI":"10.17226\/25196"},{"key":"464_CR22","unstructured":"Nolan T (2013) Alt chains and atomic transfers. Bitcointalk https:\/\/bitcointalk.org\/index.php?topic=193281.0"},{"issue":"4","key":"464_CR23","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 Q J Oper Res 4(4):263\u2013296","journal-title":"4OR Q J Oper Res"},{"issue":"1","key":"464_CR24","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. Special issue on metaheuristics in network optimization. Networks 68(1):23\u201333","journal-title":"Networks"},{"key":"464_CR25","unstructured":"Samorani M, Wang Y, Lu Z, Glover F (2019) Clustering-driven evolutionary algorithms: an application of path relinking to the QUBO problem. In: Glover F, Samorani M (eds) Special issue on intensification, diversification and learning of the Journal of Heuristics, 25(4\u20135), 629\u2013642"},{"issue":"3","key":"464_CR26","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. Eur J Oper Res 223(3):595\u2013604","journal-title":"Eur J Oper Res"},{"key":"464_CR27","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. https:\/\/www.google.de\/patents\/US20110119170. Pub. No.: US 2011\/0119170 A1. US Patent App. 12\/618,410"},{"key":"464_CR28","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. Telecommun Syst 8:1\u201323","journal-title":"Telecommun Syst"},{"key":"464_CR29","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. Eur J Oper Res 169:548\u2013569","journal-title":"Eur J Oper Res"},{"key":"464_CR30","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-540-74446-7_9","volume-title":"A path relinking approach for the multi-resource generalized quadratic assignment problem","author":"M Yagiura","year":"2007","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, vol 4638. Lecture notes in computer science. Springer, Berlin, pp 121\u2013135"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00464-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-020-00464-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00464-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T14:11:13Z","timestamp":1608300673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-020-00464-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["464"],"URL":"https:\/\/doi.org\/10.1007\/s10288-020-00464-9","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"2 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance of ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}