\(n\)-Tokyoites' loop-line commuter problem

DOI10.1016/S0012-365X(02)00747-1zbMath1029.90073OpenAlexW2009683654MaRDI QIDQ1402069

Liang Chen, Naoyuki Tokuda

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

zbMATH Keywords

matching problemHungarian algorithmAlgorithm designingData assignment problemGilmore-GomoryWeighted bipartite matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

A study on two measurements-to-tracks data assignment algorithms ⋮ Data association approaches in bearings-only multi-target tracking

This page was built for publication: \(n\)-Tokyoites' loop-line commuter problem