On the single-assignment p-hub center problem

0.00 Avg rating—0 Votes

Article ID:	iaor20011677
Country:	Netherlands
Volume:	125
Issue:	3
Start Page Number:	648
End Page Number:	655
Publication Date:	Sep 2000
Journal:	European Journal of Operational Research
Authors:	Tansel Barbaros ., Kara Bahar Y.
Keywords:	computational analysis

Abstract:

We study the computational aspects of the single-assignment p-hub center problem on the basis of a basic model and a new model. The new model's performance is substantially better in CPU time than different linearizations of the basic model. We also prove the NP-Hardness of the problem.

Reviews

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