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 6 of 6 for “"Combinatorics and Optimization"”.
-
Probabilistic Choice Models for Product Pricing Using Reservation Prices
… Uniform Model, the Share-of-Surplus Model, and the Price Sensitive Model. They are formulated as convex mixed-integer mathematical programs. We explore the properties and additional valid inequalities of these formulations. We also compare their optimal solutions on a set of inputs. In …
-
Approximating Minimum-Size 2-Edge-Connected and 2-Vertex-Connected Spanning Subgraphs
We study the unweighted 2-edge-connected and 2-vertex-connected spanning subgraph problems. A graph is 2-edge-connected if it is connected on removal of an edge, and it is 2-vertex-connected if it is connected on removal of a vertex. The problem of finding a minimum-size 2-edge-connected (or …
-
Quantum State Transfer in Graphs
Let X be a graph, A its adjacency matrix, and t a non-negative real number. The matrix exp(i t A) determines the evolution in time of a certain quantum system defined on the graph. It represents a continuous-time quantum walk in X. We say that X admits perfect state transfer from a vertex u to a …
-
New Directions in Multi-Objective Optimization with Applications
… thesis introduces the portfolio framework for optimization with multiple objectives. A portfolio is a small set of solutions that approximately optimizes every objective under consideration. This approach recognizes the inherent plurality of objectives and provides a structured way to navigate …
-
Online Allocation with Concave and Convex Objectives
… Such problems fall into the broad field of optimization under uncertainty, as each item must be allocated immediately without knowledge of future arrivals. In this thesis, we seek to develop unified algorithms and methods for online allocation problems which can account for a wider variety …
-
Two Aspects of Statistical Learning in High Dimensions: Iterative Algorithms and Average-Case Reductions
We focus on both the computational and statistical aspects of learning in high-dimensional settings. On the computational side, iterative algorithms are commonly used to fit complex models to random data, but their design and analysis are often guided by worst-case upper bounds that may not reflect …