- We will send in 10–14 business days.
/images/books/13432989/9783848449453.jpg)
- Author: Anurag Sharma
- Publisher: LAP Lambert Academic Publishing
- ISBN-10: 3848449455
- ISBN-13: 9783848449453
- Format: 15.2 x 22.9 x 1 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Application of Graph Theory in Operational Research Problems (e-book) (used book) | bookbook.eu
Reviews
Description
Nowadays, the powerful combinatorial methods found in graph theory can be used to prove significant and well-known results in a variety of areas in mathematics. In this book, we present a few selected applications of graph theory to various operation research problems. Here, we have considered four classes of problems: transportation problem, dynamic networks problem, game theory and linear programming problem. These problems can be expressed and solved elegantly as graph theory problem involving connected and weight digraphs. From a practical point of view, all of these problems are trivial if the network is small. Many real-life situations, however, consist of huge networks, and therefore, it is important to solve these network problems by taking help of computers. We have developed some important algorithms and significant models to solve these problems in a simplified manner. The wide scope of these models and other applications has been well-documented.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.10:34:40
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Anurag Sharma
- Publisher: LAP Lambert Academic Publishing
- ISBN-10: 3848449455
- ISBN-13: 9783848449453
- Format: 15.2 x 22.9 x 1 cm, minkšti viršeliai
- Language: English English
Nowadays, the powerful combinatorial methods found in graph theory can be used to prove significant and well-known results in a variety of areas in mathematics. In this book, we present a few selected applications of graph theory to various operation research problems. Here, we have considered four classes of problems: transportation problem, dynamic networks problem, game theory and linear programming problem. These problems can be expressed and solved elegantly as graph theory problem involving connected and weight digraphs. From a practical point of view, all of these problems are trivial if the network is small. Many real-life situations, however, consist of huge networks, and therefore, it is important to solve these network problems by taking help of computers. We have developed some important algorithms and significant models to solve these problems in a simplified manner. The wide scope of these models and other applications has been well-documented.
Reviews