This paper deals with the Hitchcock Transportation Problem (HTP). Specifically, the authors study the unbalanced case of the HTP. HTP is a special case of the minimum cost flow problem where the graph is bipartite and capacities are infinite.
Recensione dell'articolo:(Matsui, Tomomi; Scheifele, Rudolf - "A linear time algorithm for the unbalanced Hitchcock transportation problem." - Networks 67 (2016), no. 2, 170-182.) MR3460120 MathSciNet ISSN 2167-5163
Leonardo Pasini
2017-01-01
Abstract
This paper deals with the Hitchcock Transportation Problem (HTP). Specifically, the authors study the unbalanced case of the HTP. HTP is a special case of the minimum cost flow problem where the graph is bipartite and capacities are infinite.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
