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 4 of 4 for “"Assignment problems (Programming)."”.

  1. Neutralization of Conflict Areas Using an Ant Colony Heuristic Approach

    … technique has been very successful in solving problems such as the travelling salesman problem, vehicle routing problem, and routing and scheduling problems. The suggested approach to the problem presented here is to find routes for conflict areas and then neutralize the conflict areas. To find …

    ndsu Repository record for Neutralization of Conflict Areas Using an Ant Colony Heuristic Approach (opens in a new tab)

  2. Distributed Task Allocation Methodologies for Solving the Initial Formation Problem

    Mobile sensor networks have been shown to be a powerful tool for enabling a number of activities that require recording of environmental parameters at various spatial and temporal distributions. These mobile sensor networks could be implemented using a team of robots, usually called robotic sensor …

    gatech Repository record for Distributed Task Allocation Methodologies for Solving the Initial Formation Problem (opens in a new tab)

  3. On the nonnegative least squares

    … squares primal-dual method for solving linear programming problems. In particular, we investigate connections between this primal-dual method and the classical Hungarian method for the assignment problem. Firstly, we devise a fast procedure for computing the unrestricted least squares solution …

    gatech Repository record for On the nonnegative least squares (opens in a new tab)