Article ID: | iaor2002824 |
Country: | Spain |
Volume: | 6 |
Issue: | 1 |
Start Page Number: | 19 |
End Page Number: | 36 |
Publication Date: | Jan 1998 |
Journal: | TOP |
Authors: | Escudero Laureano F., Alonso Antonio J. |
Keywords: | programming: integer |
We present two equivalent representations of a 0–1 model for the Air Traffic Flow Management Problem. We show that the LP relaxation of the second representation is tighter than the LP relaxation of the first one. As a direct implication, the Branch-and-Cut effort can be reduced. Computational results are reported on a set of large-scale instances.