论文信息 - Unimodular matrices of flow problems with additional constraints

Unimodular matrices of flow problems with additional constraints

A graph-theoretic characterization of unimodular matrices arising from flow problems with additional constraints is developed. The resulting necessary and sufficient conditions are utilized to determine the class of unimodular matrices of multicommodity transportation problems.

Klaus Truemper | K. Truemper

[1] Klaus Truemper,et al. An efficient scaling procedure for gain networks , 1976, Networks.

[2] I. Heller. On linear systems with integral valued solutions. , 1957 .

[3] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[4] M. Sakarovitch,et al. Two commodity network flows and linear programming , 1973, Math. Program..

[5] P. Camion. Characterization of totally unimodular matrices , 1965 .

[6] George B. Dantzig,et al. Generalized Upper Bounding Techniques , 1967, J. Comput. Syst. Sci..

[7] Romesh Saigal,et al. Letter to the Editor - A Constrained Shortest Route Problem , 1968, Oper. Res..

[8] H. M. Wagner. On a Class of Capacitated Transportation Problems , 1959 .

[9] A. Hoffman,et al. On unimodular matrices , 1962 .

[10] Kenneth R. Rebman. Total unimodularity and the transportation problem: a generalization , 1974 .

[11] F. Glover,et al. Finding equivalent transportation formulations for constrained transportation problems , 1974 .

[12] G. Dantzig,et al. Integral Extreme Points , 1968 .