\(n\)-Tokyoites' loop-line commuter problem
From MaRDI portal
Publication:1402069
DOI10.1016/S0012-365X(02)00747-1zbMath1029.90073MaRDI QIDQ1402069
Publication date: 19 August 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00747-1
matching problem; Hungarian algorithm; Algorithm designing; Data assignment problem; Gilmore-Gomory; Weighted bipartite matching
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
90C27: Combinatorial optimization
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
A study on two measurements-to-tracks data assignment algorithms, Data association approaches in bearings-only multi-target tracking