Network flows: theory, algorithms, and applications (Record no. 223)

MARC details
000 -LEADER
fixed length control field 01689nam a22002297a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20190827185401.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 190827b ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9789332535152
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 658.4032
Item number AHU
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Ahuja, Ravindra K.
245 ## - TITLE STATEMENT
Title Network flows: theory, algorithms, and applications
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc. Pearson India Education Services Pvt. Ltd.
Place of publication, distribution, etc. New Delhi
Date of publication, distribution, etc. 2014
300 ## - PHYSICAL DESCRIPTION
Extent xv, 846 p.
365 ## - TRADE PRICE
Price type code INR
Price amount 939
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Table of Content<br/> 1. Introduction. <br/> 2. Paths, Trees and Cycles. <br/> 3. Algorithm Design and Analysis. <br/> 4. Shortest Paths: Label Setting Algorithms. <br/> 5. Shortest Paths: Label Correcting Algorithms. <br/> 6. Maximum Flows: Basic Ideas. <br/> 7. Maximum Flows: Polynomial Algorithms. <br/> 8. Maximum Flows: Additional Topics. <br/> 9. Minimum Cost Flows: Basic Algorithms. <br/>10. Minimum Cost Flows: Polynomial Algorithms. <br/>11. Minimum Cost Flows: Network Simplex Algorithms. <br/>12. Assignments and Matchings. <br/>13. Minimum Spanning Trees. <br/>14. Convex Cost Flows. <br/>15. Generalized Flows. <br/>16. Lagrangian Relaxation and Network Optimization. <br/>17. Multicommodity Flows. <br/>18. Computational Testing of Algorithms. <br/>19. Additional Applications. <br/>Appendix A: Data Structures. <br/>Appendix B: NP-Completeness. <br/>Appendix C: Linear Programming.
520 ## - SUMMARY, ETC.
Summary, etc. A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Network analysis (Planning)
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical optimization
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Magnanti, Thomas L.
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Orlin, James B.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type Book
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Total Renewals Full call number Accession Number Date last seen Date checked out Copy number Cost, replacement price Price effective from Koha item type Bill No Bill Date
    Dewey Decimal Classification     IT & Decisions Sciences Indian Institute of Management LRC Indian Institute of Management LRC General Stacks 06/17/2019 Overseas Press India Private 703.31 4 3 658.4032 AHU 000527 04/26/2023 09/30/2022 1 939.00 08/27/2019 Book IN28348 22-10-2019

©2019-2020 Learning Resource Centre, Indian Institute of Management Bodhgaya

Powered by Koha