On the equivalence of dual methods for two location problems

On the equivalence of dual methods for two location problems

0.00 Avg rating0 Votes
Article ID: iaor1995203
Country: United States
Volume: 27
Issue: 2
Start Page Number: 194
End Page Number: 199
Publication Date: May 1993
Journal: Transportation Science
Authors: , ,
Keywords: location
Abstract:

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. The authors explore the connection between these two algorithms.

Reviews

Required fields are marked *. Your email address will not be published.