Essays about: "NP-Hard"

Showing result 21 - 25 of 63 essays containing the word NP-Hard.

  1. 21. Efficient search of an underwater area based on probability

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Hampus Pukitis Furhoff; [2019]
    Keywords : Bayesian search theory; AUV; Heuristics; Quadtree; NP-hard; Dead reckoning; Bayesisk sökteori; AUV; Heuristik; Quadtree; NP-hart; Död räkning;

    Abstract : Today more and more different types of autonomous robots and vehicles are being developed. Most of these rely on the global positioning system and/or communication with other robots and vehicles to determine their global position. READ MORE

  3. 22. A column generation approach to scheduling of parallel identical machines

    University essay from Linköpings universitet/Matematiska institutionen

    Author : Julia Jobson; [2019]
    Keywords : Scheduling; Parallel Identical Machines; Column Generation; Large Neighbourhood Search; Mixed Integer Programming; GCG;

    Abstract : This thesis aims to implement a combination of Linear Programming Column Generation and a Large Neighbourhood Search heuristic to solve scheduling problems. The resulting method is named Integer Programming Column Search (IPCS). READ MORE

  4. 23. A comparative study between a genetic algorithm and a simulated annealing algorithm for solving the order batching problem

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Edvin Ardö; Johan Lindholm; [2019]
    Keywords : ;

    Abstract : Optimizing warehouse automation requires finding efficient routes for pickingup items. Dividing the orders into batches is a realistic requirement for warehouses to have. This problem, known as the order batching problem, is an NP-hard problem. READ MORE

  5. 24. Efficiency of Different Encoding Schemes in Swarm Intelligence for Solving Discrete Assignment Problems: A Comparative Study

    University essay from Blekinge Tekniska Högskola/Institutionen för programvaruteknik

    Author : Richard Pettersson; [2019]
    Keywords : ;

    Abstract : Background Solving problems classified as either NP-complete or NP-hard has long been an active topic in the research community, and has brought about many new algorithms for approximating an optimal solution (basically the best possible solution). A fundamental aspect to consider when developing such an algorithm is how to represent the given solution. READ MORE

  6. 25. Community-based Influence Maximization framework for Social Networks

    University essay from Högskolan i Skövde/Institutionen för informationsteknologi

    Author : Tshering Wangchuk; [2018]
    Keywords : ;

    Abstract : Maximizing Influence (IM) in social networks has a considerable role to play in the phenomenon of viral marketing, targeted advertisements and in promoting any campaigns. However, the Influence Maximization Problem is a very challenging research-problem due to it being NP-Hard and scaling with the social networks with millions of nodes and edges becomes very tough due to the computational complexities concerned with it. READ MORE