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 226 for “"combinatorial optimization"”.
-
Probabilistic combinatorial optimization problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1988.
-
Combinatorial optimization using quantum computing
This thesis explores quantum computing for combinatorial optimization through the Traveling Salesman Problem (TSP), which aims to find a minimum-cost Hamiltonian cycle visiting each city exactly once. Using Qiskit, we implement the Quantum Approximate Optimization Algorithm (QAOA) on both …
-
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) …
-
Vignettes on robust combinatorial optimization
… we design and analyze algorithms for robust combinatorial optimization in various settings. First, we consider the problem of simultaneously maximizing multiple objectives, all monotone submodular, subject to a cardinality constraint. We focus on the case where the number of objectives is …
-
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 …
-
Online Combinatorial Optimization for Digital Marketplaces
… and predictive information in time-varying combinatorial environments, facilitating decision-making in uncertain situations. Examples of such problems include assortment optimization, product ranking, and bid optimization for online advertising. The thesis overall investigates online …
-
Combinatorial optimization problems with concave costs
… problem can be reformulated as a classical combinatorial optimization problem. As a result of our bound, a variety of polynomial-time heuristics, approximation algorithms, and exact algorithms for classical combinatorial optimization problems immediately yield polynomial-time heuristics, …
-
Criticality and parallelism in combinatorial optimization
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
-
Attention-Based Learning for Combinatorial Optimization
Combinatorial optimization problems, such as the Traveling Salesman Problem (TSP), have been studied for decades. However, with the rise of reinforcement learning in recent years, many of these problems are being revisited as a way to gauge these new models in different environments. In this …
-
Proxy-Based Acceleration for Combinatorial Optimization Problems
Combinatorial optimization problems occur in a wide range of domains, from Bayesian network structure search to questions in neuroscience and biochemistry. However, all of these problems have in common the need to optimize some score, and often the calculation of this score is a significant source …
-
COMBINATORIAL OPTIMIZATION METHODS FOR PROBLEMS IN GENOMICS
I recenti progressi in genomica hanno sollevato una miriade di problemi estremamente stimolanti dal punto di vista computazionale; in particolare, per molti di essi e' stata provata l'appartenenza alla classe dei problemi NP-hard. Sulla base di questi risultati, grande attenzione e' stata posta …
-
Approximation algorithms for combinatorial optimization under uncertainty
Combinatorial optimization problems arise in many fields of industry and technology, where they are frequently used in production planning, transportation, and communication network design. Whereas in the context of classical discrete optimization it is usually assumed that the problem inputs are …
-
Faster algorithms for convex and combinatorial optimization
… to obtain the following results on convex and combinatorial optimization: --Linear Programming: We obtain the first improvement to the running time for linear programming in 25 years. The convergence rate of this randomized algorithm nearly matches the universal barrier for interior point …
-
Polyhedral aspects of cardinality constrained combinatorial optimization problems
Diese Dissertation befasst sich mit polyedrischen Strukturen von kardinalitätsbeschränkten kombinatorischen Optimierungsproblemen. Aus einem kombinatorischen Optimierungsproblem erhält man ein kardinalitätsbeschränktes kombinatorisches Optimierungsproblem, indem man nur solche Lösungen erlaubt, …
-
Hypergraph-Based Combinatorial Optimization of Matrix -Vector Multiplication
The second problem we address is parallel matrix-vector multiplication for large sparse matrices. Parallel sparse matrix-vector multiplication is a particularly important numerical kernel in computational science. We have focused on optimizing the parallel performance of this operation by reducing …
-
Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication
Combinatorial scientific computing plays an important enabling role in computational science, particularly in high performance scientific computing. In this thesis, we will describe our work on optimizing matrix-vector multiplication using combinatorial techniques. Our research has focused on two …
-
Optimal stopping problems and combinatorial optimization under uncertainty
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms
-
Fast approximation schemes for multi-criteria combinatorial optimization
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992.
-
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 …
-
Topics in Stochastic Combinatorial Optimization and Extremal Graph Theory
We consider a random geometric graph, G(n, r ), constructed by placing points randomly in a square S n of area n according to a Poisson process of intensity 1, and adding an edge joining any pair of points at most distance r=r(n) apart according to the ℓinfinity -metric. We show that w.h.p. …
Page 1 of 12