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

Author： Jinhyeon S.   Sungsoo P.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

Tight linear programming relaxations of uncapacitated p-hub median problems

By Skorin-Kapov D.   Skorin-Kapov J.   O'Kelly M.  

European Journal of Operational Research, Vol. 94, Iss. 3, 1996-11 ,pp. : 582-593

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

On the single-assignment p-hub center problem

By Kara B.Y.   Tansel B.C.  

European Journal of Operational Research, Vol. 125, Iss. 3, 2000-09 ,pp. : 648-655

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 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