The capacitated multiple allocation hub location problem: Formulations and algorithms

Author： Ebery J. Krishnamoorthy M. Ernst A. Boland N.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.120, Iss.3, 2000-02, pp. : 614-631

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem

By Ernst A.T. Krishnamoorthy M.

European Journal of Operational Research, Vol. 104, Iss. 1, 1998-01 ,pp. : 100-112

Elsevier

Access to resources Recommend Favorite

Preprocessing and cutting for multiple allocation hub location problems

By Boland N. Krishnamoorthy M. Ernst A.T. Ebery J.

European Journal of Operational Research, Vol. 155, Iss. 3, 2004-06 ,pp. : 638-653

Elsevier

Access to resources Recommend Favorite

The capacitated plant location problem

By Sridharan R.

European Journal of Operational Research, Vol. 87, Iss. 2, 1995-12 ,pp. : 203-213

Elsevier

Access to resources Recommend Favorite

A linear program for the two-hub location problem

By Sohn J. Park S.

European Journal of Operational Research, Vol. 100, Iss. 3, 1997-08 ,pp. : 617-622

Elsevier

Access to resources Recommend Favorite

A hybrid heuristic for the uncapacitated hub location problem

By Abdinnour-Helm S.

European Journal of Operational Research, Vol. 106, Iss. 2, 1998-04 ,pp. : 489-499

Elsevier

Access to resources Recommend Favorite