Description This is an assignment I took in the CS31920 Advanced Algorithms module where I had to solve a given problem using linear programming.

An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...

The Berth Allocation Problem (BAP) is the problem of allocating berthing spaces and scheduling container vessels on these spaces so as to minimize total weighted time. We study a version of BAP in ...

Fast partial tracking of audio with real-time capability through linear programming. Hungarian algorithm provides optimal spectral peak-to-peak matching in polynomial time.

This is a preview. Log in through your library . Abstract A new bounding procedure for the Quadratic Assignment Problem (QAP) is described which extends the Hungarian method for the Linear Assignment ...

The assignment problem is first converted into a linear programming problem, then a corresponding recurrent neural network is constructed. The optimality and global convergence of the proposed neural ...

Stable Matchings, Optimal Assignments, and Linear Programming By: A. E. Roth, U. G. Rothblum and J. H. Vande Vate ...