Degeneracy in the multi-source Weber problem

DOI10.1007/S101070050054MaRDI QIDQ1295966zbMATH OpenOpenAlexFDO

Authors Jack Brimberg, Nenad Mladenović

Publication date 18 March 2001

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s101070050054

zbMATH Keywords

allocationdegeneracyinsertionlocationmulti-source Weber problem

Mathematics Subject Classification ID

Continuous location (90B85)

Recommendations

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

Cited in

(16)

• The variable radius covering problem
• Variable neighborhood search for minimum sum-of-squares clustering on networks
• On strategies to fix degenerate \(k\)-means solutions
• Degeneracy on \(K\)-means clustering
• New heuristic algorithms for solving the planar p-median problem
• A new heuristic for solving the \(p\)-median problem in the plane
• Accelerating the convergence in the single-source and multi-source Weber problems
• J-means and I-means for minimum sum-of-squares clustering on networks
• Heuristics for location models
• J-MEANS: A new local search heuristic for minimum sum of squares clustering
• Clustering and the perturbed spatial median
• Variable neighborhood search for harmonic means clustering
• Qualitative properties of k-center problems
• Local solutions of the multi-source Weber problem
• The Weber problem with demand uniformly generated in discs
• New heuristic for harmonic means clustering

This page was built for publication: Degeneracy in the multi-source Weber problem

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