第52回ISCIE「確率システム理論と応用」国際シンポジウム(2020年10月, 大阪）
An Asynchronous Heuristic Algorithm for Generalized Mutual Assignment Problem: Gossip-based Approach
2021 年 2021 巻 p. 54-59
詳細
2021 年 2021 巻 p. 54-59
An asynchronous gossip-based Lagrangian heuristic algorithm is proposed for Generalized Mutual Assignment Problem (GMAP) which is a combinatorial maximization problem in distributed environments. Lagrangian decomposition based formulation is introduced for GMAP in order to apply the asynchronous gossip algorithm. This enables us to obtain a feasible solution with quality bounds.
