Approximate Algorithms for some NP-hard problems

Approximate Algorithms for some NP-hard problems


Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

₹ 3,651

Availability: Out of stock


Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product Description

In this era of information technology, many decisions are made rapidly by computers in various industries to achieve some best possible goal or objective, from routing vehicles, to deciding inventory, model networks and for efficient data retrieval.For many such problems, we cannot conduct an exhaustive search of all the solutions to find the optimal solution in polynomial time, as they have an exponential population of possibilities. Such problems are referred to as NP-hard and we have focused on such type of problems in this monograph.We have proposed some interesting approximate algorithms and heuristics to solve the Traveling Salesman Problem and the Hamiltonian Cycle Problem and get good quality solutions.The computer simulations performed show the effectiveness of our algorithms.

Product Specifications
SKU :COC24714
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-28
0 Review(s)