Essays about: "NP-Hard"

Showing result 11 - 15 of 63 essays containing the word NP-Hard.

  1. 11. Multi-dimensional Packing for Resource Allocation in 5G

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Matteo Ghetti; [2022]
    Keywords : ;

    Abstract : The Fifth Generation (5G) of wireless communication system brings a series of new challenges in resource optimization. For example optimizing the number of bits and dedicated time used by each service would improve the quality of communications. READ MORE

  3. 12. Improving The Visualization And Animation Of Weighted Dynamic Networks Using Force-Directed Graph Drawing Algorithms

    University essay from Linköpings universitet/Institutet för analytisk sociologi, IAS; Linköpings universitet/Filosofiska fakulteten

    Author : Guus Winkelmolen; [2021]
    Keywords : ;

    Abstract : The visualization of networks as graphs composed of nodes and vertices benefits many fields of science including social network analysis. The use case of visualizations is twofold. Firstly, easy initial visualization of networks will help researchers find and specify their hypotheses before having to do any technical analysis. READ MORE

  4. 13. Comparative Analysis of Ant Colony Optimization and Genetic Algorithm in Solving the Traveling Salesman Problem

    University essay from Blekinge Tekniska Högskola

    Author : Hatem Mohi El Din; [2021]
    Keywords : Ant colony optimization; genetic algorithm; metaheuristics; javascript; python; C#;

    Abstract : Metaheuristics is a term for optimization procedures/algorithms that can be applied to a wide range of problems. These problems for which metaheuristics are used usually fall in the NP-hard category, meaning that they cannot be solved in polynomial time. This means that as the input dataset gets larger the time to solve increases exponentially. READ MORE

  5. 14. Graph Complexity Based on a Heuristic That Involves the Algorithmic Complexity Behaviour of Multiplex Networks on Graphs

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

    Author : Hasan Kalzi; [2021]
    Keywords : ;

    Abstract : Since determining the complexity of multiplex networks is an NP-hard problem, I decided to calculate the complexity of graphs using heuristics. I am the first in this path who did these kinds of calculations. I always wanted to define complexity as a mathematical characteristic in the structure of graphs. READ MORE

  6. 15. A Comparative Study on a Dynamic Pickup and Delivery Problem : Improving routing and order assignment in same-day courier operations

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

    Author : Tomas Andersson; [2021]
    Keywords : Pickup and Delivery; Dial-a-Ride; Dynamic; Order assignment; Large Neighborhood Search; Pickup and Delivery; Dial-a-Ride; Dynamisk; Tilldelning av beställningar; Large Neighborhood Search;

    Abstract : Pickup and Delivery Problems (PDPs) constitute a class of Vehicle Routing Problems (VRPs) consisting of finding the optimal routes for a fleet of vehicles to deliver requests from a set of origin locations to a corresponding set of destinations. PDPs are NP-hard and have a wide variety of variants and potential constraints. READ MORE