Heuristic solution of the multisource Weber problem as a \(p\)-median problem
type: Item
instance of: scholarly article
title: Heuristic solution of the multisource Weber problem as a \(p\)-median problem
zbMATH Open document ID: 0911.90240
DOI: 10.1016/S0167-6377(98)00004-2
author: Pierre Hansen
author: Nenad Mladenović
author: Éric D. Taillard
published in: Operations Research Letters
publication date: 1998-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 1223279
zbMATH Keywords: heuristic solutions
zbMATH Keywords: large multisource Weber problems
zbMATH Keywords: \(p\)-median problems
MaRDI profile type: MaRDI publication profile
cites work: A new adaptive multi-start technique for combinatorial global optimizations
cites work: A projection method for \(l_ p\) norm location-allocation problems
cites work: Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
cites work: A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
cites work: Location-Allocation Problems
cites work: Heuristic Methods for Location-Allocation Problems
cites work: A comparison of two dual-based procedures for solving the p-median problem
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Exact and approximate solutions to the multisource weber problem
cites work: Q4203976
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: A quadratically convergent method for minimizing a sum of euclidean norms
cites work: Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem
cites work: An optimal method for solving the (generalized) multi-Weber problem
cites work: Q5767400
cites work: Q4229604
cites work: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
cites work: A polynomial time dual algorithm for the Euclidean multifacility location problem
full work available at URL: s0167-6377(98)00004-2
OpenAlex ID: W1993450447
Recommended article: New local searches for solving the multi-source Weber problem
Recommended article: A perturbation-based heuristic for the capacitated multisource Weber problem
Recommended article: The optimal solution set of the multi-source Weber problem
Recommended article: Q4715642
Recommended article: Q3598873
description: scientific article; zbMATH DE number 1223279