Solving a combinatorial problem with network flows
- 1 March 2005
- journal article
- Published by Springer Science and Business Media LLC in Journal of Applied Mathematics and Computing
- Vol. 17 (1-2), 391-399
- https://doi.org/10.1007/bf02936064
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An algorithm for minimal dynamic flowKorean Journal of Computational & Applied Mathematics, 2000
- An algorithm for generating minimal cutsets of undirected graphsJournal of Applied Mathematics and Computing, 1998
- Finding all the perfect matchings in bipartite graphsApplied Mathematics Letters, 1994
- Finding all minimum‐cost perfect matchings in Bipartite graphsNetworks, 1992
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955