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 912 for “"Combinatorial optimization"”.
-
Symmetry in combinatorial optimization
Integer optimization is in the class of NP-hard problems, and it is very time and memory intensive to find optimal solutions. In this thesis an algorithm will be developed to improve the efficiency in solving a linear integer program if there are symmetries in the problem, that is, variables can be …
-
Stochastic Minimum Norm Combinatorial Optimization
Motivated by growing interest in optimization under uncertainty, we undertake a systematic study of designing approximation algorithms for a wide class of 1-stage stochastic-optimization problems with norm-based objective functions. We introduce the model of stochastic minimum norm combinatorial …
-
Quantum algorithms for combinatorial optimization
Combinatorial Optimization problems play an important role in various domains such as logis- tics, life science or the financial sector. As their complexity in general grows exponentially with their problem size, finding the optimal solution classically becomes infeasible very fast. This raises the …
-
STUDIES ON FUZZY COMBINATORIAL OPTIMIZATION
本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである
-
Combinatorial Optimization with Reinforcement Learning
… master’s thesis delves into the topic of solving combinatorial optimization problems with methods based on reinforcement learning, and specifically, we explore the potential of iterative route decoding and gradient updates in enhancing the performance of route decoding. In this context, route …
-
Combinatorial optimization on embedded curves
… on g. We also consider the corresponding optimization problem under Z-homology. Given an integer circulation \Phi in a directed graph embedded on a surface of genus g, we describe algorithms to compute the minimum cost circulation that is Z-homologous to \Phi in O(g^8n log^2 n log^2 C) …
-
Combinatorial optimization in VLSI physical design
Simulated Annealing is a general purpose combinatorial optimization technique which has been applied to many problems in VLSI design. In essence, simulated annealing is Monte Carlo iterative improvement with the ability to conditionally accept uphill moves. The notion of a cooling schedule is …
-
Exact Methods In Fractional Combinatorial Optimization
… considers a subclass of sum-of-ratios fractional combinatorial optimization problems (FCOPs) whose linear versions admit polynomial-time exact algorithms. This topic lies in the intersection of two scarcely researched areas of fractional programming (FP): sum-of-ratios FP and combinatorial FP. …
-
COMBINATORIAL OPTIMIZATION APPROACHES TO DISCRETE PROBLEMS
… essential in solving many real-world problems. Combinatorial optimization focuses on problems arising from discrete structures such as graphs and polyhedra. This thesis deals with extremal graphs and strings and focuses on two problems: the Erdos' problem on multiplicities of complete subgraphs …
-
Correspondence among connectomes as combinatorial optimization
… to find the optimal correspondence through a combinatorial optimization problem and we discuss its similarity to the graph matching problem. Finally, we adapted an approximate solution of the graph matching to solve the correspondence. Several automatic tract segmentation methods have been …
-
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. …
-
Certifying combinatorial optimization using pseudo-Boolean reasoning
Combinatorial optimization provides a powerful framework for solving complex optimization problems with general-purpose solvers by modelling the problem in an abstract language. Due to breakthroughs in algorithms to solve combinatorial optimization problems in last decades, combinatorial …
-
New problems and algorithms in combinatorial optimization
Combinatorial optimization seeks optimal solutions from a finite set of objects. It is widely applied to many real-world problems, such as logistics, network design, and experimental design. Although the finite search space guarantees that an optimal solution can always be obtained by exhaustive …
-
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 …
-
Combinatorial Optimization of Subsequence Patterns in Words
Packing patterns in words concerns finding a word with the maximum number of a prescribed pattern. The majority of the work done thus far is on packing patterns into permutations. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation …
Page 1 of 46