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 115 for “"Exact algorithm"”.
-
An exact algorithm for first order probabilistic logic
… logic, FOPSAT for short. We next propose an exact algorithm based on delayed column generation technique, to check consistency and, if consistency holds, to entail new probability values for an additional logical sentence to be true and such that the augmented set of sentences remains …
-
An Exact Algorithm for Optimal Areal Positioning Problem with Rectangular Targets and Requests
… is based on a novel branch-and-bound (BB) algorithm devised over a reduced solution space. Branching is done using a clustering scheme. Our computational results show that in many cases our approach significantly outperforms the existing Plateau Vertex Traversal and brute force algorithms, …
-
An Exact Algorithm and a Local Search Heuristic for a Two Runway Scheduling Problem
A generalized dynamic programming based algorithm and a local search heuristic are used to solve the Two Runway Departure Scheduling Problem that arises at an airport. The objective of this work is to assign the departing aircraft to one of the runways and find a departing time for each aircraft so …
-
Efficient large flow detection over arbitrary windows: an exact algorithm outside an ambiguity region
Being able to exactly detect large network flows under an arbitrary time win- dow model is expected in many current and future applications like Denial- of-Service (DoS) flow detection, bandwidth guarantee, etc. However, to the best of our knowledge, there is no existing work that can achieve exact …
-
Understanding and Optimizing Equity-Of-Travel in Demand-Responsive Transit Services: Exact Algorithm and Learning-Based Method
… services with mathematical models and solution algorithms. Specifically, this dissertation identifies and addresses equity issues in DRT operations by first mining historical trip data of DRT services to highlight the EoT issues in real-world operations, followed by the development of exact and …
-
Relocation and deployment of sensor nodes
… network topology. We present an efficient exact algorithm for computing free-region of a given node x that runs in O( k2) time, where k is the number of in-bound and out-bound nodes of x. We also discuss approaches for developing localized approximation algorithms for estimating …
-
Robust maximum covering location problem (RMCLP)
… solution under the worst-case scenario. Three algorithms were implemented to solve the problem and find the optimal solution, including an exact algorithm and two approximate algorithms. The algorithms were evalu- ated using various instances, including the OR-Library and randomly generated …
-
Packing in two and three dimensions
… construction of new bounds, heuristics, and an exact algorithm. The bounds verify that the heuristics optimally solve 99.999% of PLP instances with up to 100 items; in the instances that the heuristics fail to solve optimally, their best solution differs from the optimum by only one item. Using …
-
Path optimization for single and multiple searchers: models and algorithms
… path. We develop a specialized branch-and-bound algorithm for this problem that utilizes several new network reduction procedures as well as new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm is quite efficient and promising. For the multiple …
-
Planar maximal covering location problem under different block norms
… different setup cost, and capacity. Second, an exact solution approach is presented based on: (1) An exact algorithm that is capable of handling a single facility efficiently. (2) An algorithm for an equivalent graph problem--the maximum clique problem (MCP). Finally, the PMCLP under different …
-
Optimal resource allocation In base stations for mobile wireless communications
… we had the following main aims: To design an exact algorithm for the subcarrier and power allocation problem with rate constraints (SPARC), the objective of which is to maximise total data transmission rate of the entire system. To design an exact algorithm for the fractional subcarrier and …
-
Three essays on bilevel optimization algorithms and applications
… <p>In the second paper, we presented an exact algorithm for the bilevel mixed integer linear programming (BMILP) problem under three simplifying assumptions. Compared to these existing ones, our new algorithm relies on weaker assumptions, explicitly considers infinite optimal, infeasible, …
-
An exact branch and bound algorithm for the general quadratic assignment problem
… research is concerned with the development of an exact algorithm for a general quadratic assignment problem (QAP), of which the Koopmans-Beckmann formulation, in the context of an analysis of the location of economic activities or facilities, is a special case. The algorithm is based on the …
-
Problema do Passeio Lucrativo com Passageiros e Restrições de Tempo - PPL-RT
… a mathematical model for the problem, an exact algorithm of solution and metaheuristics for the solution approximation. In order to operationalise the computational experiment necessary to the current research and as it’s about a model not described in the literature, test instances were …
-
ΜΕΘΟΔΟΙ ΕΠΙΛΥΣΗΣ ΓΙΑ ΠΡΟΒΛΗΜΑΤΑ ΑΝΤΙΣΤΟΙΧΗΣΗΣ ΤΡΙΩΝ ΣΥΝΟΛΩΝ
… WITH RESPECT TO THE AXIAL ASSIGNMENT PROBLEM AN EXACT ALGORITHM ISDESCRIBED. IT CAN BE EASILY IMPLEMENTED AS A PARALLEL SCHEME. A BRANCH AND BOUND ALGORITHM IS DESCRIBED FOR THE PLANAR PROBLEM. IT EMBEDS A VARIETY OF ADVANCED OPTIMIZATION TECHNIQUES. ADDITIONALLY A SIMULATED ANNEALING ALGORITHM …
-
Generalizations, Extensions, and Applications of the Sequential Knapsack Problem
… smallest to largest. We present an O(n^2 log n) algorithm that solves SKP and the Bounded Sequential Knapsack Problem (B-SKP) exactly, by exploiting the divisibility property of the constraint. We then adapt this algorithm to provide an approximate solution for the more general Consecutive …
-
Search algorithms for the simple plant location problem
"Two algorithms are developed, one exact, one approximate, for finding solutions to the simple plant location problem. Theorems are proved which give sufficient conditions for the inclusion of a plant in the optimal solution. The exact algorithm which is developed is similar to the Branch and Bound …
-
Optimal Implementation of Simulink Models on Multicore Architectures with Partitioned Fixed Priority Scheduling
… (MILP) formulation; and (b) a problem specific exact algorithm that may run several magnitudes faster than MILP.
-
Essays on International Trade and Financial Economics
… Regarding financial economics, we provide an exact algorithm for efficient computation of models that have an ARCH(?) representation, a technique often used to estimate the volatility of exchange rates. Finally, we develop a model for analysis of information transparency of optimal financial …
-
On learning and visualizing lexicographic preference trees
… tree models learned by a greedy learning algorithm; 2) for preference learning, a genetic algorithm is designed and implemented, called GA, that learns a restricted type of lexicographic preference tree, called unconditional importance and unconditional preference tree, or UIUP trees for …
Page 1 of 6