Alternative Integer linear and Quadratic Programming Formulations for HA-Assignment Problems

Abstract

Home-Away Assignment problems are naturally cast as quadratic programming models in binary variables. In this work we compare alternative formulations. First, we propose another formulation by manipulating their special structure to obtain versions with 1/4 of the original size. By linearizing the quadratic objective function, we get two more alternative models to be compared with the quadratic ones. Numerical experiments exhibit the characteristics of each model.