Approximate Algorithms for some NP-hard problems: Some Novel Heuristics and Meta-heuristics for the TSP and the HCP problems - Brossura

Sabharwal, Nitish; Sharma, Harshit

Brossura

ISBN 10: 3659150924 ISBN 13: 9783659150920

Casa editrice: LAP LAMBERT Academic Publishing, 2012

Riassunto

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.

Su questo libro

L'autore

I'm a computer scientist working at Ivy Comptech as a Software developer. I have done my B.E. in Computer Science from BITS Pilani in India and have been involved in the field of research involving NP-hard problems and AI algorithms since my college,having published 4 research papers in various international conferences and journals.

Dettagli dell'edizione

• Editore: LAP LAMBERT Academic Publishing
• Data di pubblicazione: 2012
• Lingua: Inglese
• ISBN 10: 3659150924
• ISBN 13: 9783659150920
• Rilegatura: Copertina flessibile
• Numero di pagine: 56
• Contatto del produttore: non disponibile
• Persona responsabile: KreGa Onlinehandel GmbH; 4950000000000; info@krega-onlinehandel.de; ; Birkenweg 31; Brakel; 33034; Germania