Flows on hypergraphs

Data:	1997
Resum:	We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network simplex algorithms for the standard and for the generalized minimum cost flow problems, most of the computations performed at each pivot operation have direct hypergraph interpretations. .
Drets:	Tots els drets reservats.
Llengua:	Anglès
Document:	Article ; recerca ; Versió publicada
Matèria:	Flows ; Leontief flows ; Hypergraphs ; Simplex algorithm
Publicat a:	Mathematical Programming, vol. 78 n. 2 (1997) p. 195-217, ISSN 0025-5610

23 p, 998.3 KB

Accés restringit a la UAB

Registre creat el 2006-03-13, darrera modificació el 2023-06-03