Further results on the algebraic characterizations of a minimum cost network flow problem equivalent to the transportation problem

DOI10.1080/00207160512331331192zbMath1068.90535OpenAlexW1974620838MaRDI QIDQ5460575

S. Safak, Hamza Bulut, Mustafa Özel

Publication date: 18 July 2005

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160512331331192

zbMATH Keywords

singular value decompositiongeneralized inversestransportation problemminimum cost network flow problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

This page was built for publication: Further results on the algebraic characterizations of a minimum cost network flow problem equivalent to the transportation problem