Construction and algebraic characterizations of a planar four-index transportation problem equivalent to a circularization network flow problem
From MaRDI portal
Publication:4467335
DOI10.1080/00207160310001603325zbMath1048.90031OpenAlexW2024537828MaRDI QIDQ4467335
Publication date: 9 June 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160310001603325
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further results on the spectral decomposition of an incidence matrix
- Construction and algebraic characterizations of the planar and axial transportation problems
- Spectral decompositions and generalized inverse in a circularization network flow problem
- Algebraic characterizations of the singular value decompositions in the transportation problem
- On the dimension of polytopes of planar three-index transportation problems
- Singular Value Decomposition and the Moore–Penrose Inverse of Bordered Matrices
- A generalized-indices transportation problem
- A Note on Kronecker Matrix Products and Matrix Equation Systems
- The Multi-Index Problem