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 282 for “"Combinatorial optimization problems"”.
-
Metaheuristics for NP-hard combinatorial optimization problems
… 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 that can, with deployment of local search, improve performance of Ant System to solve …
-
Solving Combinatorial Optimization Problems using Statistical Learning
This thesis examines the use of geometric deep neural networks to provide competent solutions (in terms of runtime versus duality gap), not necessarily incumbent, to the capacitated vehicle routing problem and the bin packing problem—which have non-deterministic polynomial computational complexity. …
-
Primal-Dual Algorithms for Combinatorial Optimization Problems
Combinatorial optimization problems such as routing, scheduling, covering and packing problems abound in everyday life. At a very high level, a combinatorial optimization problem amounts to finding a solution with minimum or maximum cost among a large number of feasible solutions. An algorithm for …
-
Incorporating UAVs into urban logistics combinatorial optimization problems
… Vehicles (UAVs), or drones, into urban logistic combinatorial optimization problems. Specifically, this dissertation analyzes how the adoption of drones would improve the efficiency of the last-mile urban logistic system and how it can be used in specific scenarios such as post-disaster. This …
-
Ranking K Best Solutions to Combinatorial Optimization Problems
… have direct applicability to managerial decision problems in the mining and scheduling domains. Planning often requires finding solutions to real-world problems through simplified models, but these simplifications necessarily fail to capture all the complexities of the problem. As such, a model's …
-
Ranking K Best Solutions to Combinatorial Optimization Problems
… have direct applicability to managerial decision problems in the mining and scheduling domains. Planning often requires finding solutions to real-world problems through simplified models, but these simplifications necessarily fail to capture all the complexities of the problem. As such, a model's …
-
Studies on Metaheuristic Algorithms for Combinatorial Optimization Problems
本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである
-
Algorithms for exact solutions to combinatorial optimization problems
The Shortest Superstring Problem (SSP) is a combinatorial optimization problem which has attracted the interest of many researchers due to its applications. It can be applied in computational molecular biology problems such as DNA sequencing, and in computer science problems such as string …
-
Hardware Acceleration of Machine Learning and Combinatorial Optimization Problems
… Among AI workloads, machine learning (ML) and combinatorial optimization (CO) are two of the most computationally demanding yet fundamentally distinct domains. ML workloads exhibit dense and parallelizable dataflows, while CO problems involve irregular and constraint-driven computations. To …
-
Applications of X-Heuristics in Complex Combinatorial Optimization Problems
[ES] En muchas industrias, las empresas deben tomar decisiones en situaciones complejas con múltiples variables y restricciones. Estas situaciones a menudo pueden formularse como problemas de optimización combinatoria (COPs). Resolver estos problemas es esencial para mejorar la productividad y la …
-
A Differential Evolution Algorithm for Generic Combinatorial Optimization Problems
Combinatorial optimization problems (COPs) are well-known NP-hard realistic ones. Due to the drawbacks of existing approaches, many researchers proposed different evolutionary algorithms (EAs) for solving them. Differential evolution (DE) is primarily used to solve continuous-based optimization …
-
Parameterised complexity analysis of evolutionary algorithms for combinatorial optimization problems
… that have been successfully used in solving combinatorial optimization problems. However, due to the great amount of randomness in these algorithms, theoretical understanding of them is quite challenging. In this thesis we analyse the parameterized complexity of evolutionary algorithms on …
-
On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems
Studying the approximation threshold of NP-hard optimization problems, i.e. the ratio of the objective value achievable by a polynomial time algorithm to that of the optimal solution is an important field in theoretical computer science. In the past two decades there has been significant …
-
RANDOM COMBINATORIAL OPTIMIZATION PROBLEMS: MEAN FIELD AND FINITE-DIMENSIONAL RESULTS
… physics before. In this thesis I will analyze combinatorial optimization problems, from a physics point of view. In the first two chapters I will review some basic notions of statistical physics of disordered systems, such as random graph theory, the mean-field approximation, spin glasses and …
-
EUCLIDEAN CORRELATIONS IN COMBINATORIAL OPTIMIZATION PROBLEMS: A STATISTICAL PHYSICS APPROACH
In this thesis I discuss combinatorial optimization problems, from the statistical physics perspective. The starting point are the motivations which brought physicists together with computer scientists and mathematicians to work on this beautiful and deep topic. I give some elements of complexity …
-
Combinatorial Optimization Problems under Deterministic, Stochastic, and Dynamic Scheduling Decisions
L'abstract è presente nell'allegato / the abstract is in the attachment
Page 1 of 15