Bookcover of Approximate Algorithms for some NP-hard problems
Booktitle:

Approximate Algorithms for some NP-hard problems

Some Novel Heuristics and Meta-heuristics for the TSP and the HCP problems

LAP LAMBERT Academic Publishing (2012-06-14 )

Books loader

Omni badge eligible for voucher
ISBN-13:

978-3-659-15092-0

ISBN-10:
3659150924
EAN:
9783659150920
Book language:
English
Blurb/Shorttext:
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.
Publishing house:
LAP LAMBERT Academic Publishing
Website:
https://www.lap-publishing.com/
By (author) :
Nitish Sabharwal, Harshit Sharma
Number of pages:
56
Published on:
2012-06-14
Stock:
Available
Category:
Mathematics
Price:
49.00 €
Keywords:
artificial intelligence, Traveling Salesman Problem, algorithms, Hamiltonian, NP, Design and Complexity, Ant Colony Systems

Books loader

Newsletter

Adyen::diners Adyen::jcb Adyen::discover Adyen::amex Adyen::mc Adyen::visa Adyen::cup Adyen::unionpay Adyen::paypal Paypal CryptoWallet Wire Transfer

  0 products in the shopping cart
Edit cart
Loading frontend
LOADING