Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 1370 for “"NP-Hard"”.
-
Partitioning methods for NP-hard routing problems
… on developing partitioning frameworks for NP-hard routing problems. Specifically, different partitioning methods are applied to the traveling salesman problem (TSP), resource-constrained shortest path problem (RCSPP), and other related problems. The TSP framework, referred to as convex hull …
-
Approximation algorithms for NP-hard clustering problems
… each of these problems, it is known to be N P-hard to compute a solution with cost less than a certain constant factor times the optimal cost. We give simple constant-factor approximation algorithms for the facility location, k-median, and online median problems with optimal or near-optimal …
-
Metaheuristics for NP-hard combinatorial optimization problems
In one part of this work, we studied how decomposition-based search methods can improve running time performance when solving very large optimization instances. In another part of the work, carried out a theoretical analysis on convergence properties of Graph-based Ant System and derived a method …
-
Algorithms for NP-hard Optimization Problems and Cluster Analysis
… dominating set problem are all classical NP-hard optimization problems of great importance in both theory and real applications. Since the exact algorithms, which require exhaustive exploration of exponentially many options, are infeasible in practice, approximation algorithms and …
-
Performance modelling and automated algorithm design for NP-hard problems
… some important classes of problems are NP-complete. Although no worst-case polynomial time algorithm exists for solving them, state-of-the-art algorithms can solve very large problem instances quickly, and algorithm performance varies significantly across instances. In addition, such …
-
Fitness landscape analysis of a class of np-hard problems
… of randomly generated instances of a class of NP-hard combinatorial optimisation problems are empirically studied in this research. We believe that the studied properties give insight into the structure of the problem landscape and can be representative of the problem difficulty, in particular …
-
Linear and nonlinear semidefinite relaxations of some NP-hard problems
… bounds and obtain approximate solutions for NP-hard problems. This thesis introduces and studies several novel linear and nonlinear semidefinite relaxation models for some NP-hard problems. We first study the semidefinite relaxation of Quadratic Assignment Problem (QAP) based on matrix …
-
Learning NP-hard problems on networks using Geometric Deep Learning
… However, many problems on networks remain hard to define formally and even harder to solve exactly (for instance for computational constraints), requiring sub-optimal heuristics. In this work we show how Geometric Deep Learning, the generalization of Deep Learning to non-Euclidean domains …
-
A Polynomial Algorithm for a NP-hard to solve Optimization Problem
Since Markowitz in 1952 described an efficient and practical way of finding the optimal portfolio allocation in the normal distributed case, a lot of progress in several directions has been made. The main objective of this thesis is to replace the original risk measure of the Markowitz setting by a …
-
Scalable and Robust Solutions for NP-Hard Problems in Large Signed Networks
… heuristic algorithms designed to address common NP-hard problems encountered in signed networks. Our empirical evaluations demonstrate the untapped potential of these algorithms, showing their competitive edge over established baselines in terms of accuracy and computational efficiency. Finally, …
-
Structural Properties of NP-Hard Sets and Uniform Characterisations of Complexity Classes
… most important complexity classes are the class NP and the subclass of NP-complete problems, which comprises many important optimisation problems in the field of operations research. Moreover, with the P-NP-problem, the class NP represents the most important unsolved question in computer science. …
-
An analysis of combinatorial search spaces for a class of NP-hard problems
… are state of the art for many classes of NP-hard combinatorial optimization problems such as maximum k-satisfiability, scheduling, and problems of graph theory. In this thesis we analyze combinatorial search spaces by expanding the objective function into a (sparse) series of basis …
-
Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems
NP-hard problems have numerous applications in various fields such as networks, computer systems, circuit design, etc. However, no efficient algorithms have been found for NP-hard problems. It has been commonly believed that no efficient algorithms for NP-hard problems exist, i.e., that P6=NP. …
-
A Blueprint for Semidefinite Relaxations of Binary-Constrained Quadratic Programs Computing tight bounds on NP-hard problems using ADMM
… thesis looks at the solution techniques of two NP-hard, large scale problems, the quadratic assignment problem, QAP, and the side chain positioning, SCP, problem. We summarize existing approaches from and look at the two problems in a unified way using a binary-constrained quadratic program, …
-
Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics
Parameterized NP-hard problems are NP-hard problems that are associated with special variables called parameters. One example of the problem is to find simple paths of length k in a graph, where the integer k is the parameter. We call this problem the p-path problem. The p-path problem is the …
-
NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
… three decades raises a question, is ETsparse hard? In this thesis we give an affirmative answer to the question by showing that it is NP-hard over any field. Sparse orbit complexity of a polynomial f is the smallest integer s_0 such that there exists an invertible transform A such that f(Ax) …
-
Resilience of wireless sensor networks
… sensor network with 2D surveillance domain is NP-hard for the case when the sensor coverage regions are unit line segments. Furthermore, it is possible to extend the reduction to show that the problem remains NP-hard for other types of sensor coverage regions. In general, if the shape of the …
-
Parameterized algorithms and computational lower bounds: a structural approach
… of practical significance are known to be NP-hard, and hence, are unlikely to be solved by polynomial-time algorithms. There are several ways to cope with the NP-hardness of a certain problem. The most popular approaches include heuristic algorithms, approximation algorithms, and randomized …
-
Solving Chromatic Number with Quantum Search and Quantum Counting
… algorithm. Chromatic Number is an example of an NP-Hard problem, which suggests that other NP-Hard problems can also benefit from a speed-up provided by quantum technology. This has wide implications as many real world problems can be framed as NP-Hard problems, so any speed-up in the solution of …
Page 1 of 69