Abstract: The traditional assignment problem assumes that the number of persons is equal to that of the tasks, beyond that, one person is allowed to undertake only one task and one task must be ...

This repository is an implementation of a local search algorithm (Hill Climbing) to solve the Assignment Problem. The Assignment Problem is a combinatorial optimization problem that involves assigning ...

Abstract: This article investigates a dynamic slab assignment problem (DSAP) that arises in the slab production process of steel industry. In DSAP, a set of slabs and orders arrive dynamically at each ...

The integer traffic assignment problem (ITAP) is a routing problem consisting of finding the optimal paths with given endpoints, so to minimize the congestion on a graph. Each folder is named after ...