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 714 for “"Optimization Problems"”.

  1. Online optimization problems

    In this thesis, we study online optimization problems in routing and allocation applications. Online problems are problems where information is revealed incrementally, and decisions must be made before all information is available. We design and analyze algorithms for a variety of online problems, …

    mit Repository record for Online optimization problems (opens in a new tab)

  2. Cardinality Constrained Optimization Problems

    In this thesis, we examine optimization problems with a constraint that allows for only a certain number of variables to be nonzero. This constraint, which is called a cardinality constraint, has received considerable attention in a number of areas such as machine learning, statistics, …

    purdue-thes Repository record for Cardinality Constrained Optimization Problems (opens in a new tab)

  3. Probabilistic combinatorial optimization problems

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1988.

    mit Repository record for Probabilistic combinatorial optimization problems (opens in a new tab)

  4. Approximation of Multiobjective Optimization Problems

    We study optimization problems with multiple objectives. Such problems are pervasive across many diverse disciplines -- in economics, engineering, healthcare, biology, to name but a few -- and heuristic approaches to solve them have already been deployed in several areas, in both academia and …

    columbia-diss Repository record for Approximation of Multiobjective Optimization Problems (opens in a new tab)

  5. Optimization Problems in Data Mining

    "We introduce a novel type of rule, wherein claims of the form ""our object ranked r or better in x of the last t time units,"" are formalized, and where maximal claims of this form are defined under two natural partial orders. For the first, we give an efficient and optimal algorithm for finding …

    uiuc Repository record for Optimization Problems in Data Mining (opens in a new tab)

  6. Optimization problems with incomplete information

    … and analysis of algorithms for new variants of optimization problems where the problem instance is not completely known. Specifically, we consider two online problems where the problem instance is revealed over time, and one distributed problem involving many computational units, each of which …

    mit Repository record for Optimization problems with incomplete information (opens in a new tab)

  7. Optimization problems in network connectivity

    … theory for more than five decades, network optimization has assumed increased significance in recent times with the advent and widespread use of a variety of large-scale real-life networks. The primary goal of such networks is to connect vertices (representing a variety of real-life …

    mit Repository record for Optimization problems in network connectivity (opens in a new tab)

  8. Spectral Optimization Problems Controlling Wave Phenomena

    Design problems seek a material arrangement or shape which fully harnesses the physical properties of the material(s) to create an environment in which a particular phenomena is most (or least) pronounced. Mathematically, design problems are formulated as PDE-constrained optimization problems to …

    columbia-diss Repository record for Spectral Optimization Problems Controlling Wave Phenomena (opens in a new tab)

  9. Constrained Optimization Problems in Network Models

    … that deals with solving various application problems. Constrained optimization problems are one of the most important and useful fields of mathematics, particularly in Operations Research. In this thesis, we focus our attention on some mathematical models that are decision problems and which …

    catania Repository record for Constrained Optimization Problems in Network Models (opens in a new tab)

  10. Optimization problems in networks and queues

    … applied probability, stochastic processes, and optimization, unified by their mathematical techniques. Each chapter studies a distinct question motivated by systems that evolve randomly over time and are subject to structural or resource constraints. Despite their diverse contexts, ranging from …

    uiuc Repository record for Optimization problems in networks and queues (opens in a new tab)

  11. Combinatorial optimization problems with concave costs

    … and linear in 1/c. For several concave cost problems, the resulting piecewise linear 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 …

    mit Repository record for Combinatorial optimization problems with concave costs (opens in a new tab)

  12. Mathematical Software for Multiobjective Optimization Problems

    In this thesis, two distinct problems in data-driven computational science are considered. The main problem of interest is the multiobjective optimization problem, where the tradeoff surface (called the Pareto front) between multiple conflicting objectives must be approximated in order to identify …

    vt Repository record for Mathematical Software for Multiobjective Optimization Problems (opens in a new tab)

  13. Some Optimization Problems in Wireless Networks

    … a fundamental advance on network performance optimization via exploring a series of optimization problems. Based on the scale of the underlying wireless network, the works in this dissertation are divided into two parts. In the first part, we study the asymptotic capacity scaling laws of …

    vt Repository record for Some Optimization Problems in Wireless Networks (opens in a new tab)

  14. MATHEMATICAL PROGRAMMING ALGORITHMS FOR NETWORK OPTIMIZATION PROBLEMS

    In the thesis we consider combinatorial optimization problems that are defined by means of networks. These problems arise when we need to take effective decisions to build or manage network structures, both satisfying the design constraints and minimizing the costs. In the thesis we focus our …

    milano Repository record for MATHEMATICAL PROGRAMMING ALGORITHMS FOR NETWORK OPTIMIZATION PROBLEMS (opens in a new tab)

  15. 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 …

    unm Repository record for Proxy-Based Acceleration for Combinatorial Optimization Problems (opens in a new tab)

  16. Quantum computing for biophysical and optimization problems

    … as promising avenues for tackling real-world problems. In this study, we focus on two particularly challenging biophysics problems: protein design and polymer sampling. Protein design involves engineering the primary sequence of a protein to ensure that it folds into a specific target …

    trento Repository record for Quantum computing for biophysical and optimization problems (opens in a new tab)

  17. Localization and Optimization Problems for Camera Networks

    … in a network of cameras one of the most crucial problems is calibration. For each camera this consists in understanding what is its position and orientation with respect to a global common reference frame. Well-known methods in computer vision permit to obtain relative positions and orientations …

    poli-torino Repository record for Localization and Optimization Problems for Camera Networks (opens in a new tab)

  18. A water flow algorithm for optimization problems

    … the water flow algorithm (WFA), for solving optimization problems has been proposed. The algorithm is designed by simulating the hydrological cycle in meteorology and the erosion phenomenon in nature. Basic operators of this algorithm are based on the raindrop distribution simulation, the …

    nus Repository record for A water flow algorithm for optimization problems (opens in a new tab)

  19. Timing-driven optimization problems in VLSI CAD

    We study several optimization problems that arise in the design of VLSI circuits, with the satisfaction of timing constraints as the primary objective. We focus on problems where the underlying architecture is regular. Field Programmable Gate Arrays (FPGAs), identical standard cell based …

    uiuc Repository record for Timing-driven optimization problems in VLSI CAD (opens in a new tab)

Page 1 of 36