\(n\)-Tokyoites' loop-line commuter problem (Q1402069): Difference between revisions

The paper deals with the \(n\)-Tokyoites' loop-line computer problem which comprises a special class of the more general Gilmore-Gomory weighted bipartite matching problem where weights assigned to arcs are given in terms of integrals of some functions. The algorithm proposed by the authors runs in \(O(n^2)\) time and is faster than the more popularly used Hungarian-type \(O(n^3)\) algorithms applicable to the more general weighted bipartite matching problem. Moreover, the algorithm developed by the authors allows to impose some novel angular constraints which find an immediate application not only on the \(n\)-Tokyoites' loop-line commuter problem itself, but also to the data association problem involved in the multisensor-multitarget tracking process and to the specifically defined Gilmore-Gomory's original TSP problem.