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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783659150920
Cantidad disponible: 2 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Sabharwal NitishI 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 an. Nº de ref. del artículo: 5135185
Cantidad disponible: Más de 20 disponibles
Librería: preigu, Osnabrück, Alemania
Taschenbuch. Condición: Neu. Approximate Algorithms for some NP-hard problems | Some Novel Heuristics and Meta-heuristics for the TSP and the HCP problems | Nitish Sabharwal (u. a.) | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783659150920 | Verantwortliche Person für die EU: LAP Lambert Academic Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu. Nº de ref. del artículo: 106414909
Cantidad disponible: 5 disponibles
Librería: Mispah books, Redhill, SURRE, Reino Unido
paperback. Condición: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Nº de ref. del artículo: ERICA82936591509246
Cantidad disponible: 1 disponibles