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 98 for “"Assignment problems"”.

  1. Transportation problems and assignment problems

    … for certain types of linear programming problems that are widely used in mathematical modeling of real life situations. One of the most useful of these special purpose algorithms is transportation method. In a classical transportation problem the cost is minimized by selecting the optimal …

    ut-knoxville Repository record for Transportation problems and assignment problems (opens in a new tab)

  2. Deep Learning for Bipartite Assignment Problems

    A recurring problem in autonomy is the optimal assignment of agents to tasks. Often, such assignments cannot be computed efficiently. Therefore, the existing literature tends to focus on the development of handcrafted heuristics that exploit the structure of a particular assignment problem. These …

    adelaide Repository record for Deep Learning for Bipartite Assignment Problems (opens in a new tab)

  3. Assignment Problems for Optimizing Text Input

    … Firstly, the design problem is formulated as an assignment problem for integer programming. This enables the use of standard mathematical solvers and algorithms for efficiently finding good solutions. Then, objective functions are developed, for assessing their optimality with respect to motor …

    aalto Repository record for Assignment Problems for Optimizing Text Input (opens in a new tab)

  4. The Graph Matching and Quadratic Assignment Problems

    … (Vogelstein, 2015), replacing it's linear sum assignment step with the "Lightspeed Optimal Transport" method of Cuturi (2013). The modification provides a speed improvement by replacing the main computational bottleneck, as well as robustness to stochasticity between graph pairs. The …

    jhu Repository record for The Graph Matching and Quadratic Assignment Problems (opens in a new tab)

  5. Assignment problems and their application in economics

    Four assignment problems are introduced in this thesis, and they are approached based on the context they are presented in. The underlying graphs of the assignment problems in this thesis are in most cases bipartite graphs with two sets of vertices corresponding to the agents and the resources. An …

    maryland Repository record for Assignment problems and their application in economics (opens in a new tab)

  6. Solving very large scale school/student assignment problems

    … conventional methods exist to deal with such problems, yet the sheer magnitude of the HISD student assignment problem presents new computational challenges which must be dealt with effectively if the problem is to be solved. This monograph examines issues related to finding the solution of …

    rice Repository record for Solving very large scale school/student assignment problems (opens in a new tab)

  7. Fast and Robust Mathematical Modeling of NMR Assignment Problems

    … one of the main bottleneck steps is backbone assignment. When a homologous structure is available, it can accelerate assignment. Such structure-based methods are the focus of this thesis. This thesis aims for fast and robust methods for NMR assignment problems; in particular, structure-based …

    waterloo Repository record for Fast and Robust Mathematical Modeling of NMR Assignment Problems (opens in a new tab)

  8. Sequentially connected 2D assignment problems solved using Lagrangian dual methods

    … program, which consists of several connected 2D assignment problems. To solve these, we utilize LP relaxation which results in a lower bound on the optimal value unless the problem possesses integrality property, in which case it equals the optimal value. We have implemented two methods to …

    chalmers Repository record for Sequentially connected 2D assignment problems solved using Lagrangian dual methods (opens in a new tab)

  9. Solving concentrator location and terminal assignment problems using simulated annealing

    … of terminals only. This is known as the terminal assignment problem. These problems are NP-complete. Therefore, finding a polynomial time algorithm to solve them to optimality is highly unlikely. This study aims to develop some efficient algorithms based on simulated annealing to solve these …

    concordia Download PDF for Solving concentrator location and terminal assignment problems using simulated annealing (opens in a new tab)

  10. Practical approaches to complex role assignment problems in role-based collaboration

    Group role assignment (GRA) is an important task in Role-Based Collaboration (RBC). The complexity of group role assignment becomes very high as the constraints are introduced. According to recent studies, considerable efforts have been put towards research on complex group role assignment …

    laurentian Repository record for Practical approaches to complex role assignment problems in role-based collaboration (opens in a new tab)

  11. Models and Solution Algorithms for Asymmetric Traffic and Transit Assignment Problems

    … interactions of flows in the traffic and transit assignment problems with an efficient solution algorithm. The study begins with characterizing the asymmetrically formulated equilibrium problem in terms of the convergence, and the computational efficiencies followed by demonstrating the enhanced …

    utahstate Repository record for Models and Solution Algorithms for Asymmetric Traffic and Transit Assignment Problems (opens in a new tab)

  12. GPU-based Lagrangian heuristic for multidimensional assignment problems with decomposable costs

    Multidimensional assignment problem (MAP) is one of the many formulations of data association problem which categorizes data based on various data sources. A higher number of data sources ensures an accurate categorization of data. But it also leads to a significant increase in the amount of data, …

    uiuc Repository record for GPU-based Lagrangian heuristic for multidimensional assignment problems with decomposable costs (opens in a new tab)

  13. Theoretical and computational advances in finite-size facility placement and assignment problems

    … Traditionally, the facility location/layout problems are modeled as the Quadratic Assignment Problem (QAP), which is strongly NP-hard. Also, for getting strong lower bounds in the dominance procedure, we may need to solve an instance of the NP-hard Quadratic Semi-Assignment Problem (QSAP). To …

    uiuc Repository record for Theoretical and computational advances in finite-size facility placement and assignment problems (opens in a new tab)

  14. Sequential Assignment Problems and Their Application to Task Allocation in Satellite Constellations

    … autonomous, scalable, and real-time dynamic task assignment. The satellite constellation setting is unique among task allocation problems in that orbital mechanics dictates that assignments between agents and tasks must change frequently. This gives rise to the Sequential Assignment Problem (SAP), …

    washington Repository record for Sequential Assignment Problems and Their Application to Task Allocation in Satellite Constellations (opens in a new tab)

  15. Investigation of k-rationality & cutting plane methods in sequentially connected 2D assignment problems

    Integer linear optimization problems are generally difficult to solve efficiently due to the discrete nature of their solution spaces. A common approach to address these difficulties is to relax the integrality constraints, solve a continuous optimization problem, and utilize different methods to …

    chalmers Repository record for Investigation of k-rationality & cutting plane methods in sequentially connected 2D assignment problems (opens in a new tab)

  16. Solving school bus routing and student assignment problems with heuristic and column generation approach.

    … of students at the same time. Also, a student assignment mathematical model is presented to optimize the number of bus stops in use as well as one important measure of service quality, the total student walking distance. Comparing to the classic clustering methods, heuristic methods, or other …

    louisville Repository record for Solving school bus routing and student assignment problems with heuristic and column generation approach. (opens in a new tab)

  17. Panel Stacking and Worker Assignment Problems in Residential Construction Using Prefabricated Panels: A Lean Approach

    … model of the corresponding panel stacking problems in which the goal is to minimize total weighted panel move distance concurrent with certain construction assumptions. The heuristic method was provided to establish how each panel would be stacked and gave the drop-off location of each …

    vt Repository record for Panel Stacking and Worker Assignment Problems in Residential Construction Using Prefabricated Panels: A Lean Approach (opens in a new tab)

  18. Large-Scale Modeling and Optimization of Routing, Modulation and Spectrum Assignment Problems in Optical Networks

    … requests, known as the Routing and Spectrum Assignment (RSA) problem, and its extension: Routing, Modulation and Spectrum Assignment (RMSA) problem. Such problems are becoming more and more challenging everyday with the steadily increasing demand in optical networking. Therefore, considerable …

    concordia Download PDF for Large-Scale Modeling and Optimization of Routing, Modulation and Spectrum Assignment Problems in Optical Networks (opens in a new tab)

Page 1 of 5