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

Sabharwal, Nitish; Sharma, Harshit

Softcover

ISBN 10: 3659150924 ISBN 13: 9783659150920

Publisher: LAP LAMBERT Academic Publishing, 2012

Synopsis

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.

About this title

About the Author

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.

Edition details

• Publisher: LAP LAMBERT Academic Publishing
• Publication date: 2012
• Language: English
• ISBN 10: 3659150924
• ISBN 13: 9783659150920
• Binding: Paperback
• Number of pages: 56