Generating good starting solutions for the p-median problem in the plane

DOI10.1016/j.endm.2012.10.030zbMath1268.90133MaRDI QIDQ2840779

Nenad Mladenović, Said Salhi, Jack Brimberg, Zvi Drezner

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.030

zbMATH Keywords

optimization; heuristic; location; plane

Mathematics Subject Classification ID

90B85: Continuous location

90C59: Approximation methods and heuristics in mathematical programming

Related Items

New heuristic algorithms for solving the planar \(p\)-median problem, New local searches for solving the multi-source Weber problem, The planar multifacility collection depots location problem, A new local search for continuous location problems, Generating good starting solutions for the p-median problem in the plane

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• A new heuristic for solving the \(p\)-median problem in the plane
• The big cube small cube solution method for multidimensional facility location problems
• Improving worst-case behavior of heaps
• Attraction probabilities in variable neighborhood search
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• A projection method for \(l_ p\) norm location-allocation problems
• Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
• Generating good starting solutions for the p-median problem in the plane
• On the Complexity of Some Common Geometric Location Problems
• Location-Allocation Problems
• TSPLIB—A Traveling Salesman Problem Library
• Heuristic Methods for Location-Allocation Problems