The multi-commodity maximum flow problem.

The multi-commodity maximum flow problem.

Saved in:
Bibliographic Details
Main Author: Sakarovitch, Michel
Format: Book
Language:English
Published: Berkeley : University of Calif., 1966.
Series:Repo / (University of California - Operations Research Center
Subjects:
Linear programming.
Network analysis (Planning)
LEADER 00881nam a22002411 4500
001 c000196535
003 CARM
005 20021125001700.0
008 851003s1966 cau 0 eng d
019 1 |a 3977838  |5 LACONCORD2021 
035 |a (OCoLC)1090921  |5 LACONCORD2021 
100 1 |a Sakarovitch, Michel. 
245 1 4 |a The multi-commodity maximum flow problem. 
260 |a Berkeley :  |b University of Calif.,  |c 1966. 
490 1 |a Repo / (University of California - Operations Research Center 
500 |a Cover title. 
500 |a Processed. 
650 0 |a Linear programming. 
650 0 |a Network analysis (Planning) 
852 8 |b CARM  |h A2:AE02H0  |i F00846  |p 0297464  |f BK 
082 0 4 |a 658.4032 
999 f f |i 2a73ad8a-39b5-58fd-9ab6-1e96e3c12c22  |s 2ff1e736-b689-55d2-a832-498270fd339b 
952 f f |p Can circulate  |a CAVAL  |b CAVAL  |c CAVAL  |d CARM 1 Store  |e F00846  |f A2:AE02H0  |h Other scheme  |i book  |m 0297464 

Similar Items