Preprocessing and cutting for multiple allocation hub location problems

Preprocessing and cutting for multiple allocation hub location problems

0.00 Avg rating0 Votes
Article ID: iaor20051659
Country: Netherlands
Volume: 155
Issue: 3
Start Page Number: 638
End Page Number: 653
Publication Date: Jun 2004
Journal: European Journal of Operational Research
Authors: , , ,
Keywords: programming: integer
Abstract:

In this paper we consider formulations and solution approaches for multiple allocation hub location problems. We present a number of results, which enable us to develop preprocessing procedures and tightening constraints for existing mixed integer linear programming formulations. We employ flow cover constraints for capacitated problems to improve computation times. We present the results of our computational experience, which show that all of these steps can effectively reduce the computational effort required to obtain optimal solutions.

Reviews

Required fields are marked *. Your email address will not be published.