| Description |
1 online resource |
| Series |
Chapman & Hall mathematics |
|
Chapman & Hall mathematics.
|
| Summary |
Problems in network optimization arise in all areas of technology and industrial management. The topic of network flows has applications in diverse fields such as chemistry, engineering, management science, scheduling and transportation, to name a few. Network Optimization introduces the subject to undergraduate and graduate students in computer science, mathematics and operations research. The focus is mainly on developing the mathematical underpinnings of the techniques that make it possible to solve the several optimization problems covered in the text. The text discusses such topics as optimal branching problems, transshipment problems, shortest path problems, minimum cost flow problems, maximum flow problems, matching in bipartite and nonbipartite graphs and many applications to combinatorics. Also included is a large number of exercises |
| Bibliography |
Includes bibliographical references and index |
| Notes |
V.K. Balakrishnan is a professor of mathematics at the University of Maine, USA |
|
Online resource; title from PDF title page (EBSCO, viewed March 16, 2021) |
|
Print version record |
| Subject |
Network analysis (Planning)
|
|
Mathematical optimization.
|
|
Mathematical optimization
|
|
Network analysis (Planning)
|
| Form |
Electronic book
|
| ISBN |
9781000723083 |
|
1000723089 |
|
1000715264 |
|
9781000715262 |
|
