MARC 닫기
00433nam ac200169 k 4500
000003536727
20220101120000
ta
010731s1993 US 000 eng
▼a 211070
▼c 211070
▼l WM0004010943
▼l WM0004010944
▼c 2
▼a T57.85
▼a T57.85
▼b A3
▼a NETWORK FLOWS/
▼d AHUJA,RAVINDRA K
▼a ENGLEWOOD CLIFFS:
▼b PRENTICE-HALL,
▼c 1993.
▼a 846p.
▼a AHUJA,RAVINDRA K
▼a 단행본
| 자료유형 : | 단행본 |
|---|---|
| 분류기호 : | T57.85 |
| 서명/저자사항 : | NETWORK FLOWS/ AHUJA,RAVINDRA K |
| 발행사항 : | ENGLEWOOD CLIFFS: PRENTICE-HALL, 1993. |
| 형태사항 : | 846p. |
| 개인저자 : | AHUJA,RAVINDRA K |
| 언어 | 영어 |
WMO199903862
권 호 : 846
발행년 : 1993
서 명 : NETWORK FLOWS
발행처 : AHUJA,RAVINDRA K
목차
1. PATHS,TREES,AND CYCLES
2. ALGORITHM DESIGN AND ANALYSIS
3. SHORTEST PATHS:LABEL-SETTING ALGORITHMS
4. SHORTEST PATHS:LABEL-CORRECTING ALGORITHMS
5. MAXIMUM FLOWS:BASIC IDEAS
6. " " :POLYNOMIAL ALGORITHMS
7. " " :ADDITIONAL TOPICS
8. MINIMUM COST FLOWS:BASIC ALGORITHMS
9. " " :POLYNOMIAL ALGORITHMS
10. " " :NETWORK SIMPLEX ALGORITHMS
11. ASSIGNMENTS AND MATCHINGS
12. MINIMUM SPANNING TREES
13. CONVEX COST FLOWS
14. GENERALIZED FLOWS
15. LAGRANGIAN RELAXATION AND NETWORK OPTIMIZATION
16. MULTICOMMODITY FLOWS
서평쓰기