| 000 | 00926camuuu200301 a 4500 | |
| 001 | 000000396104 | |
| 005 | 19970910092651.0 | |
| 008 | 960509s1995 enka b 001 0 eng d | |
| 010 | ▼a 95067613 | |
| 015 | ▼a GB95-44763 | |
| 020 | ▼a 0412556707 | |
| 040 | ▼a GU ▼c DLC ▼d GUA ▼d UKM | |
| 042 | ▼a lccopycat | |
| 049 | ▼a ACCL ▼l 111064320 | |
| 050 | 0 0 | ▼a T57.85 ▼b .B37 1995 |
| 082 | 0 0 | ▼a 658.4/032 ▼2 20 |
| 090 | ▼a 658.4032 ▼b B171n | |
| 100 | 1 | ▼a Balakrishnan, V. K., ▼d 1931- |
| 245 | 1 0 | ▼a Network optimization / ▼c V.K. Balakrishnan. |
| 250 | ▼a 1st ed. | |
| 260 | ▼a London ; ▼a New York : ▼b Chapman & Hall, ▼c [1995]. | |
| 300 | ▼a viii, 248 p. : ▼b ill. ; ▼c 24 cm. | |
| 440 | 0 | ▼a Chapman & Hall mathematics. |
| 504 | ▼a Includes bibliographical references (p. [233]-234) and index. | |
| 650 | 0 | ▼a Network analysis (Planning). |
| 650 | 0 | ▼a Mathematicl optimization. |
| 653 | 0 | ▼a Planning ▼a Networks ▼a Analysis |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 중앙도서관/교육보존A/6 | 청구기호 658.4032 B171n | 등록번호 111064320 (1회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
Topics include optimal branching problems, trans-shipment problems, shortest path problems, minimum cost flow problems, maximum flow problems, matching in bipartite and nonbipartite graphs, and applications to combinatorics.
Topics include optimal branching problems, trans-shipment problems, shortest path problems, minimum cost flow problems, maximum flow problems, matching in bipartite and nonbipartite graphs, and applications to combinatorics.
정보제공 :
목차
PrefaceTrees, arborescences and branchingsTransshipment problemsShortest path problemsMinimum cost flow problemsMatching in graphsReferencesSolutions to selected problemsIndex
정보제공 :