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

We formulated and solved the fleet assignment problem as an integer linear programming model, permitting assignment of two or more fleets to a flight schedule simultaneously. The objective function ...

Linear programming has several advantages for solving logistics problems. First, LP can handle large-scale problems with many variables and constraints, using efficient algorithms and software.

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

The routing and spectrum assignment problem is an NP-hard problem that receives increasing attention during the last years. Existing integer linear programming ...