Technical Note—On the Equivalence of Dual Methods for Two Location Problems | Zendy

Ning Xu | Zendy; Timothy J. Lowe | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—On the Equivalence of Dual Methods for Two Location Problems

Author(s) -

Ning Xu,

Timothy J. Lowe

Publication year - 1993

Publication title -

transportation science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.965

H-Index - 115

eISSN - 1526-5447

pISSN - 0041-1655

DOI - 10.1287/trsc.27.2.194

Subject(s) - equivalence (formal languages) , dual (grammatical number) , connection (principal bundle) , mathematical optimization , linear programming , simple (philosophy) , facility location problem , computer science , mathematics , algorithm , discrete mathematics , geometry , art , philosophy , literature , epistemology

Separate algorithms have been reported in the literature to find dual solutions to the linear programming relaxations of the simple plant location problem, and the location covering problem. We explore the connection between these two algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research