An Efficient Algorithm for Solving the Rectilinear Multifacility Location Problem

DOI10.1093/IMANUM/6.3.343MaRDI QIDQ3769879zbMATHOpenAlexFDO

Authors Achiya Dax

Publication date 1986

Published in IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/imanum/6.3.343

zbMATH Keywords

linear programmingNumerical resultsoptimality testfirst-order direct methodGauss-Seidel-type methodrectilinear multifacility location problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Efficient solutions of multicriteria location problems with rectilinear norm
• A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES
• An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
• A fast algorithm for the rectilinear distance location problem
• Solving Structured Multifacility Location Problems Efficiently

Cited in

(14)

• Duality for constrained multifacility location problems with mixed norms and applications
• One more well-solved case of the multifacility location problem
• scientific article; zbMATH DE number 1253055 (Why is no real title available?)
• The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
• scientific article; zbMATH DE number 2161568 (Why is no real title available?)
• Acceleration of the HAP approach for the multifacility location problem
• A fast algorithm for the rectilinear distance location problem
• A note on optimality conditions for the Euclidean. Multifacility location problem
• Geometric interpretation of the optimality conditions in multifacility location and applications
• scientific article; zbMATH DE number 3848936 (Why is no real title available?)
• Solving a continuous multifacility location problem by DC algorithms
• Linear programming via least squares
• Theorems of the alternative and duality
• A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES

This page was built for publication: An Efficient Algorithm for Solving the Rectilinear Multifacility Location Problem

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