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

This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving algorithmic problems that seek optimal ...

The traffic assignment problem (TAP) with elastic demands can be formulated as an optimization problem, the objective of which is the sum of a congestion function and a disutility function. We propose ...