Network programming

著者

• Murty, Katta G.

書誌事項

Network programming

Katta G. Murty

Prentice Hall, c1992

注記

Includes bibliographical references and index

内容説明・目次

内容説明

This book covers the advances in network flow methods ranging across modelling, applications, algorithms, their implementations, and computational complexity. It deals with the problems faced by network structures that can be handled by linear programming techniques or the adaptations. This publication is aimed at professionals involved in mathematical and linear programming in the areas of operations research, industrial engineering, other branches of engineering and business applications.

目次

1. Network Definitions and Formulations. 2. Single Commodity Maximum Value Flow Problems in Pure Networks. 3. Primal-Dual and Dual Algorithms for the Assignment and Transportation Problems. 4. Shortest Chain Algorithms. 5. Algorithms for Minimum Cost Flow Problems in Pure Networks. 6. Single Commodity Flows with Additional Linear Constraints. 7. Critical Path Methods in Project Networks. 8. Generalized Network Flows. 9. The Minimum Cost Spanning Tree Problem. 10. Blossom Algorithms for 1-Matching/Edge Covering Problems in Indirected Networks. Index.

「Nielsen BookData」 より

• NII書誌ID(NCID): BA18131975
• ISBN:
  • 013615493X
• LCCN: 91045726
• 出版国コード: us
• タイトル言語コード: eng
• 本文言語コード: eng
• 出版地: Englewood Cliffs, N.J.
• ページ数/冊数: xvi, 623 p.
• 大きさ: 25 cm
• 分類:
  • LCC : QA76.66
  • DC20 : 658.4/032
• 件名:
  • LCSH : Systems programming (Computer science)
  • LCSH : Computer networks