Mauricio G. C. Resende, K. G. Ramakrishnan, Zvi Drezner, Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming, Operations Research, Vol.

Interfaces, Vol. 20, No. 4, The Practice of Mathematical Programming (Jul. - Aug., 1990), pp. 133-149 (17 pages) The auction algorithm is an intuitive method for solving the classical assignment ...

Learn what is simulated annealing, how it works, and how to apply it to common linear programming problems in operations research.

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

This repository contains the final assignment submissions for the course "Fundamentals of Operational Research" within the Postgraduate Program in Applied Computing at the University of Brasília. For ...

This paper deals with solving large instances of the Linear Sum Assignment Problems (LSAPs) under realtime constraints, using Graphical Processing Units (GPUs). The motivating scenario is an ...