In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integer linear programming formulation of the QAP, which we call formulation IPQAP-I. We analyze two cases: In the first case, we study the effect of constraint reduction. In the second case, we study the effect of variable...

The problem of pole assignment, also known as an eigenvalue assignment, in linear discrete-time periodic systems in discs was solved by a novel method which employs elementary similarity operations. The former methods tried to assign the points inside the unit circle while preserving the stability of the discrete time periodic system. Nevertheless, now we can obtain the location of eigenvalues ...

Among the multitude of activities of Hajj Organization which require careful planning bus assignment to the Iranian pilgrim caravans d g pilgrimage is the most important one. The objective of this assignment is to have a minimum number o standing passengers/empty seats, while satisfying a large number of operational and religious constrain. This problem was formulated as a large scale zero-one ...