Tight linear programming relaxations of uncapacitated p-hub median problems

Author： Skorin-Kapov D. Skorin-Kapov J. O'Kelly M.

Publisher： Elsevier

ISSN： 0377-2217

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

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

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

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

Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes

By Saez J.

European Journal of Operational Research, Vol. 121, Iss. 3, 2000-03 ,pp. : 609-626

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