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

Publisher： Elsevier

ISSN： 0377-2217

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

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

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

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

A gamma heuristic for the p-median problem

By Rosing K.E. ReVelle C.S. Schilling D.A.

European Journal of Operational Research, Vol. 117, Iss. 3, 1999-09 ,pp. : 522-532

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