Heuristics for Location Models
From MaRDI portal
Publication:5506730
DOI10.1007/978-1-4419-7572-0_15zbMath1387.90109OpenAlexW150776006MaRDI QIDQ5506730
Publication date: 16 December 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-7572-0_15
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (4)
A new heuristic for solving the \(p\)-median problem in the plane ⋮ A trajectory based heuristic for the planar \(p\)-median problem ⋮ Improved starting solutions for the planar p-median problem ⋮ Using injection points in reformulation local search for solving continuous location problems
Cites Work
- The \(p\)-median problem: a survey of metaheuristic approaches
- A comparison of two dual-based procedures for solving the p-median problem
- Fast primal and dual heuristics for the \(p\)-median location problem
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- An efficient tabu search procedure for the \(p\)-median problem
- Degeneracy in the multi-source Weber problem
- A statistical analysis of simulated annealing applied to the \(p\)-median problem
- Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
- Variable neighborhood decomposition search
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- On the Complexity of Some Common Geometric Location Problems
- The maximum return-on-investment plant location problem with market share
- Location-Allocation Problems
- Local convergence in Fermat's problem
- Variable neighborhood search for the p-median
- Heuristic Methods for Location-Allocation Problems
- Large neighborhood local search for the p-median problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- A note on Fermat's problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Heuristics for Location Models
