Efficient Pairing in Unknown Environments: Minimal Observations and TSP-Based Optimization

Efficient Pairing in Unknown Environments: Minimal Observations and TSP-Based Optimization

Generating paired sequences with maximal compatibility from a given set is one of the most important challenges in various applications, including information and communication technologies. However, the number of possible pairings explodes in a double factorial order as a function of the number of...

Full description

Bibliographic Details
Main Authors: Naoki Fujita, Nicolas Chauvet, Andre Rohm, Ryoichi Horisaki, Aohan Li, Mikio Hasegawa, Makoto Naruse
Format: Article
Language:English
Published: IEEE 2022-01-01
Series:IEEE Access
Subjects:
Pairing
exchange rule
traveling salesman problem
maximum weighted matching
combinatorial optimization
compatibility
Online Access:https://ieeexplore.ieee.org/document/9785571/

Internet

https://ieeexplore.ieee.org/document/9785571/

Similar Items