|
|
|
|
| LEADER |
00000cam a2200000 7i4500 |
| 001 |
0000086243 |
| 005 |
20140630093000.0 |
| 008 |
140302s2010 nju eng |
| 020 |
|
|
|a 0470462728
|
| 020 |
|
|
|a 9780470462720
|
| 050 |
0 |
0 |
|a T57.74
|b .B39 2010
|
| 090 |
0 |
0 |
|a T57.74
|b .B39 2010
|
| 100 |
1 |
|
|a Bazaraa, M. S. ,
|e author
|
| 245 |
1 |
0 |
|a Linear programming and network flows
|c Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali
|
| 246 |
3 |
0 |
|a Linear programming & network flows
|
| 250 |
|
|
|a 4th ed
|
| 260 |
|
|
|a Hoboken, New Jersey :
|b John Wiley & Sons ,
|c c2010
|
| 300 |
|
|
|a xiv, 748 p. :
|b ill. ;
|c 25 cm.
|
| 504 |
|
|
|a Includes bibliographical references (p. 681-732) and index
|
| 505 |
0 |
|
|a 1. Introduction -- 2. Linear algebra, convex analysis, and polyhedral sets -- 3. The simplex method -- 4. Starting solution and convergence -- 5. Special simplex implementations and optimality conditions -- 6. Duality and sensitivity analysis -- 7. The decomposition principle -- 8. Complexity of the simplex algorithm and polynomial-time algorithms -- 9. Minimal-cost network flows -- 10. The transportation and assignment problems -- 11. The out-of-kilter algorithm -- 12. Maximal flow, shortest path, multicommodity flow, and network synthesis problems
|
| 520 |
|
|
|a The only book to treat both linear programming techniques and network flows under one cover, this book has been conpletely updated with the latest developments on the topic. This new edition continues to successfully emphasize modeling concepts, the design and analysis of algorithms, and implementation strategies for problem in a variety of fields, including industrial engineering, management science, operations research, computer science, and mathematics
|
| 650 |
|
0 |
|a Linear programming
|
| 650 |
|
0 |
|a Network analysis (Planning)
|
| 700 |
1 |
|
|a Jarvis, John J. ,
|e author
|
| 700 |
1 |
|
|a Sherali, Hanif D. ,
|d 1952- ,
|e author
|
| 999 |
|
|
|a 1000161614
|b Book
|c OPEN SHELF (30 DAYS)
|e Gong Badak Campus
|