Preprocessing and cutting for multiple allocation hub location problems

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

Publisher： Elsevier

ISSN： 0377-2217

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

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

Related content

The capacitated multiple allocation hub location problem: Formulations and algorithms

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

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

Elsevier

Access to resources Recommend Favorite

Solving large single allocation p-hub problems with two or three hubs

By Ebery J.

European Journal of Operational Research, Vol. 128, Iss. 2, 2001-01 ,pp. : 447-458

Elsevier

Access to resources Recommend Favorite

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

Efficient solution procedure and reduced size formulations for p-hub location problems

By Jinhyeon S. Sungsoo P.

European Journal of Operational Research, Vol. 108, Iss. 1, 1998-07 ,pp. : 118-126

Elsevier

Access to resources Recommend Favorite

A double annealing algorithm for discrete location/allocation problems

By Righini G.

European Journal of Operational Research, Vol. 86, Iss. 3, 1995-11 ,pp. : 452-468

Elsevier

Access to resources Recommend Favorite