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 196 for “"Discrete Optimization"”.
-
Learning Models for Discrete Optimization
<p>We consider a class of optimization approaches that incorporate machine learning models into the algorithm structure. Our focus is on the algorithms that can learn the patterns in the search space in order to boost computational performance. The idea is to design optimization techniques that …
-
Discrete optimization of upgrade scheduling
A primary objective of the mission to meet climate change goals of reducing greenhouse gas (GHG) emissions is to transition from fossil fuels to zero-emission energy. Fossil fuel production and transportation account for approximately half of the GHG emissions in Canada, making transitioning to …
-
Towards GPU-accelerated discrete optimization
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2027-12-01
-
discrete optimization models in data visualization
… are modeled and solved using nonlinear optimization techniques. In this dissertation, we propose a discretization of the data visualization problem that allows us to formulate it as a quadratic assignment problem. This formulation is computationally difficult to solve optimally using an …
-
Discrete optimization problems in geometric mesh processing
… graphics reduce geometric problems to numerical optimization problems by minimizing an energy that captures the geometric properties we seek. These methods often encounter challenges in the presence of complex global geometric constraints that cannot be easily expressed as numerical …
-
Discrete Optimization Methods for Segmentation and Matching
This dissertation studies discrete optimization methods for several computer vision problems. In the first part, a new objective function for superpixel segmentation is proposed. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term. The …
-
High performance computing algorithms for discrete optimization
… the application of High Performance Computing to Discrete Optimization, and the development of massively parallel algorithms designed to accelerate the solving process of Mixed-Integer Programs (MIPs). We begin by presenting a portfolio of scalable parallel primal heuristics, which focus on …
-
Topics in linear and nonlinear discrete optimization
This work contributes to modeling, theoretical, and practical aspects of structured Mathematical Programming problems. Many real-world applications have nonlinear characteristics and can be modeled as Mixed Integer Nonlinear Programming problems (MINLP). Modern global solvers have significant …
-
Discrete optimization via simulation with stochastic constraints
… of constraint violation and it converts a discrete optimization via simulation (DOvS) problem with stochastic constraints into a series of DOvS problems without stochastic constraints. PFM determines a penalty of a visited solution based on past results of feasibility checks on the …
-
Higher-Order Continuous Formulations For Discrete Optimization Problems
… of a family of higher-order polynomial optimization problems which exhibits a hierarchical structure of local and global optima, different from previously known hierarchies in the field of optimization. Additional results obtained include a tighter description for the set of local and …
-
Discrete Optimization and Statistical Analysis for Healthcare Applications
Operations Research has been continuously extending into new applications to optimize and explain reality through a methodological and analytical perspective. Healthcare systems are no exception, as they require operational solutions to traditional problems such as scheduling, routing, inventory …
-
Topics in discrete optimization: models, complexity and algorithms
In this dissertation we examine several discrete optimization problems through the perspectives of modeling, complexity and algorithms. We first provide a probabilistic comparison of split and type 1 triangle cuts for mixed-integer programs with two rows and two integer variables in terms of cut …
-
Russian doll search algorithms for discrete optimization problems
… discusses exhaustive search algorithms for discrete optimization problems. The search space of the problems is pruned by determining different lower or upper bounds for the solution of the problem. In some cases, redundant candidates can be pruned on the basis of structural symmetry. One …
-
Hybrid Discrete Optimization for Route Planning and Scheduling
Combinatorial optimization is intimately related to various scientific disciplines that originated from different historical roots, such as constraint programming and satisfiability. Despite their differences in origin, the methods developed within these fields exhibit many similarities while …
-
Discrete Optimization Problems under Ranking-Based Choice Models
… choice model. We focus on the assortment optimization problem under this choice model. First, we show that this problem is NP-hard even for k=2. Motivated by this result, we show that the assortment problem under the 2-product nonparametric choice model can be reduced to a well-known graph …
-
DISCRETE OPTIMIZATION PROBLEMS ARISING IN SUPPLY CHAIN OPTIMIZATION
Supply chain optimization is a key component for any business providing supply chain services. In today's competitive environment, it is essential to maintain operations at their peak efficiency. We study various discrete optimization problems related to supply chain optimization. First, we study …
Page 1 of 10