Explaining how to apply to mathematical programming to network design and control, Linear Programming and Algorithms for Communication Networks: A Practical Guide to Network Design, Control, and Management fills the gap between mathematical programming theory and its implementation in communication networks. From the basics all the way through to more advanced concepts, its comprehensive coverage provides readers with a solid foundation in mathematical programming for communication networks. Addressing optimization ...
Read More
Explaining how to apply to mathematical programming to network design and control, Linear Programming and Algorithms for Communication Networks: A Practical Guide to Network Design, Control, and Management fills the gap between mathematical programming theory and its implementation in communication networks. From the basics all the way through to more advanced concepts, its comprehensive coverage provides readers with a solid foundation in mathematical programming for communication networks. Addressing optimization problems for communication networks, including the shortest path problem, max flow problem, and minimum-cost flow problem, the book covers the fundamentals of linear programming and integer linear programming required to address a wide range of problems. It also: Examines several problems on finding disjoint paths for reliable communications Addresses optimization problems in optical wavelength-routed networks Describes several routing strategies for maximizing network utilization for various traffic-demand models Considers routing problems in Internet Protocol (IP) networks Presents mathematical puzzles that can be tackled by integer linear programming (ILP) Using the GNU Linear Programming Kit (GLPK) package, which is designed for solving linear programming and mixed integer programming problems, it explains typical problems and provides solutions for communication networks. The book provides algorithms for these problems as well as helpful examples with demonstrations. Once you gain an understanding of how to solve LP problems for communication networks using the GLPK descriptions in this book, you will also be able to easily apply your knowledge to other solvers.
Read Less
Add this copy of Linear Programming and Algorithms for Communication to cart. $61.04, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2016 by CRC Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Contains: Illustrations, black & white, Tables, black & white. Includes: illustrations, black & white, tables, black & white. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Linear Programming and Algorithms for Communication to cart. $61.05, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2016 by CRC Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Contains: Illustrations, black & white, Tables, black & white. Includes: illustrations, black & white, tables, black & white. Intended for professional and scholarly audience.
Add this copy of Linear Programming and Algorithms for Communication to cart. $78.17, new condition, Sold by Booksplease rated 4.0 out of 5 stars, ships from Southport, MERSEYSIDE, UNITED KINGDOM, published 2016 by CRC Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Contains: Illustrations, black & white, Tables, black & white. Includes: illustrations, black & white, tables, black & white. Intended for professional and scholarly audience.