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 120 for “"Exact Algorithms"”.
-
EXACT ALGORITHMS FOR GENOME ASSEMBLY
… of scaffolding and finishing genomes using exact algorithms. First, I explored the feasibility of an exact approach and presented the first tractable solution (Opera) for the scaffolding problem. In comparison with existing scaffolders, Opera produces longer and more accurate scaffolds, …
-
Exact algorithms for routing problems
… (VRP) has motivated the development of many exact algorithms and heuristics. In the VRP, a planner designs minimum-cost-delivery routes from a depot to a set of geographically distributed customers, subject to capacity and business constraints. This problem is an important component of …
-
EXACT ALGORITHMS FOR SIZE CONSTRAINED CLUSTERING
This thesis investigates the following general constrained clustering problem: given a dimension $d$, an $L^p$-norm, a set $X\subset\R^d$, a positive integer $k$ and a finite set $\mathcal M\subset\N$, find the optimal $k$-partition $\{A_1,...,A_k\}$ of $X$ w.r.t. the $L^p$-norm satisfying …
-
Cutting and packing : problems, models and exact algorithms
Different integer programming models and exact algorithms for hard cutting and packing problems are addressed. We consider in particular the combinatorial problems of this family that are defined over a single dimension. The optimization procedures rely on tools from the field of integer …
-
Exact Algorithms for Mixed-Integer Multilevel Programming Problems
… (two-stage stochastic programming). Traditional exact approaches for solving multistage optimization problems often rely on strong duality either for the purpose of achieving single-level reformulations of the original multistage problems, or for the development of cutting-plane approaches …
-
Robust Exact Algorithms for the Euclidean Bipartite Matching Problem
… this problem in O(n^3) time. There are many algorithms that have a run time better than that of the Hungarian algorithm if the graphs have non-negative integer edge costs bounded by C. Since the input points have real-valued coordinates and the Euclidean distances can be irrational, such …
-
Exact Algorithms for Network Fortification and Design Problems under Stochastic Interdiction
Networks such as telecommunication, transportation, and logistics play a vital role in sustaining social, economic, and industrial operations. However, networks are at risk of natural and man-made disruptions. With the increasing interconnectivity of networks, a disruption in one network can …
-
Fast exact algorithms for optimization problems in resource allocation and switched linear systems
… to solve. In this thesis, we develop new fast exact algorithms for discrete optimization problems arising in the field of resource allocation and switched linear systems. The first problem is the discrete resource allocation problem with nested bound constraints. It is a fundamental problem …
-
Modeling, Analysis, and Exact Algorithms for Some Biomass Logistics Supply Chain Design and Routing Problems
… routing problems, and in developing effective exact algorithms for their solution. In the routing area, we have addressed extensions of the well-known traveling salesman and vehicle routing problems. We have proposed new formulations and have developed exact algorithms for the single and …
-
Algorithm Engineering for some Complex Practise Problems
This work deals with the design of exact algorithms and heuristics for complex optimization problems that origin from three practical applications and one classical combinatorial task. We obtain exact algorithms by modeling our problems in terms of mathematical optimization problems and applying …
-
Uma análise experimental de algoritmos exatos aplicados ao problema da árvore geradora multiobjetivo
… strategies used in the literature to develop exact algorithms to solve the problem. Initially, the algorithms are classified according to the approaches used to solve the problem. Features of two or more approaches can be found in some of those algorithms. The approaches investigated here are: …
-
On Gene Duplication
… has been made in this area with efficient exact algorithms that can transform one genome to another applying a wide range of evolutionary operations. However, gene duplications, a common occurrence and arguably the most important evolutionary operation, have proven to be one of the most …
-
Analytical Investigations in Heat Exchanger Network Synthesis
Although exact algorithms have been successful in tackling HENS problems of small size, heuristics are required for large-scale problems, and nothing is known about the quality of the solutions provided by heuristics. Analytical investigations are suggested to characterize the behavior of both …
-
Two Combinatorial Optimization Problems at the Interface of Computer Science and Operations Research
… is proven to be NP-hard. To solve this problem, exact algorithms and heuristic methods are presented. Different multi-objective problems with various numbers of objectives and constraints are used to compare the performances of the proposed algorithms and heuristics.
-
MEASURES AND ALGORITHMS FOR THE EXACT SATISFIABILITY PROBLEM AND ITS VARIANTS
In this thesis, we study the Exact Satisfiability problem and its variants. The 5 problems that are studied are: Exact Satisfiability (XSAT) and General k Exact Satisfiability problems (Decision), #X3SAT (Counting), Max Hamming Distance XSAT and Max Hamming Distance X3SAT (Optimization problems). …
-
Uma análise experimental de algoritmos metaheurísticos para um problema de caminho mais curto multiobjetivo na computação em nuvem
… only two objectives are considered, not exist exact algorithms efficient for the problem. It is proposed, therefore, an algorithm Transgenético, since the technique has already been successfully applied to other multiobjective problems. The proposed algorithm is compared to the NSGA-II, an …
Page 1 of 6