Quantum Bridge Analytics II: Combinatorial Chaining for Asset Exchange

Quantum Bridge Analytics relates to methods and systems for hybrid classical-quantum computing and is devoted to developing tools for bridging classical and quantum computing to gain the benefits of their alliance in the present and enable enhanced practical application of quantum computing in the future. This is the second of a two-part tutorial that surveys key elements of Quantum Bridge Analytics and its applications. Part I focused on the Quadratic Unconstrained Binary Optimization (QUBO) model which is presently the most widely applied optimization model in the quantum computing area, and which unifies a rich variety of combinatorial optimization problems. Part II (the present paper) examines an application that augments the use of QUBO models, by disclosing a context for coordinating QUBO solutions through a model we call the Asset Exchange Problem (AEP). Solutions to the AEP enable individuals or institutions to take fuller advantage of solutions to their QUBO models by exchanges of assets that benefit all participants. Such exchanges are generated by an approach called combinatorial chaining, which provides a flexibility to solve AEP variants that open the door to additional links to quantum computing applications. Examples are presented that show the nature of these processes from a tutorial perspective.

[1]  Fred W. Glover,et al.  Ejection chain and filter-and-fan methods in combinatorial optimization , 2006, 4OR.

[2]  Fred W. Glover,et al.  A path relinking approach with ejection chains for the generalized assignment problem , 2006, Eur. J. Oper. Res..

[3]  Fred W. Glover,et al.  Doubly‐rooted stem‐and‐cycle ejection chain algorithm for the asymmetric traveling salesman problem , 2016, Networks.

[4]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .

[5]  B. Rothschild,et al.  MULTICOMMODITY NETWORK FLOWS. , 1969 .

[6]  Darwin Klingman,et al.  Netform Modeling and Applications , 1990 .

[7]  Fred W. Glover,et al.  Ejection chain and filter-and-fan methods in combinatorial optimization , 2006, 4OR.

[8]  Sebastian Pokutta,et al.  Perfect formulation of the futures opening auction problem , 2014 .

[9]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[10]  Holger H. Hoos,et al.  Programming by optimization , 2012, Commun. ACM.

[11]  Fred W. Glover,et al.  Network models in optimization and their applications in practice , 1992 .

[12]  Arjang A. Assad,et al.  Multicommodity network flows - A survey , 1978, Networks.

[13]  Fred W. Glover,et al.  Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..

[14]  Division on Earth,et al.  The National Academies of SCIENCES • ENGINEERING • MEDICINE , 2016 .

[15]  Keld Helsgaun,et al.  General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..

[16]  Fred W. Glover,et al.  Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems , 2018, Eur. J. Oper. Res..