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

DOI10.1287/TRSC.27.2.194MaRDI QIDQ4280738zbMATH OpenOpenAlexFDO

Authors Ning Xu, Timothy J. Lowe

Publication date 24 February 1994

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.27.2.194

zbMATH Keywords

dual solutionslinear programming relaxationslocation coveringplant location

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Linear programming (90C05)

Recommendations

• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
• scientific article; zbMATH DE number 1022482
• A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction
• scientific article; zbMATH DE number 970362
• scientific article; zbMATH DE number 3885614

Cited in

(4)

• scientific article; zbMATH DE number 3885614 (Why is no real title available?)
• scientific article; zbMATH DE number 58448 (Why is no real title available?)
• scientific article; zbMATH DE number 1022482 (Why is no real title available?)
• The dual of a generalized minimax location problem

This page was built for publication: Technical Note—On the Equivalence of Dual Methods for Two Location Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4280738)