A modified Cooper algorithm for large-scale multi-source Weber problem

MaRDI QIDQ5382249zbMATH OpenFDO

Authors Jianlin Jiang, Yunwen Pan

Publication date 21 June 2019

zbMATH Keywords

Cooper algorithmgreedy cluster splittingmulti-source Weber problemout-of-use facilities

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Discrete location and assignment (90B80) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Accelerating the convergence in the single-source and multi-source Weber problems
• The optimal solution set of the multi-source Weber problem
• On the convergence of the Cooper's algorithm
• scientific article; zbMATH DE number 946717
• An algorithm for generalized constrained multi-source Weber problem with demand substations

Cited in

(3)

• Degeneracy in the multi-source Weber problem
• Accelerating the convergence in the single-source and multi-source Weber problems
• scientific article; zbMATH DE number 946717 (Why is no real title available?)

This page was built for publication: A modified Cooper algorithm for large-scale multi-source Weber problem

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