A fast swap-based local search procedure for location problems
From MaRDI portal
Publication:2480210
Recommendations
Cites work
- A branch-and-price approach to p-median location problems
- A Dual-Bounded Algorithm for the p-Median Problem
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- A hybrid heuristic for the \(p\)-median problem
- A note on solving large p-median problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An efficient tabu search procedure for the p-median problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Fundamentals of scatter search and path relinking
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Heuristic concentration: Two stage solution construction
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Heuristic methods for large centroid clustering problems
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- scientific article; zbMATH DE number 1754597 (Why is no real title available?)
- scientific article; zbMATH DE number 2114494 (Why is no real title available?)
- scientific article; zbMATH DE number 2230234 (Why is no real title available?)
- Introduction to algorithms
- Local search heuristic for k-median and facility location problems
- Mersenne twister
- Stabilized column generation
- The Optimal Diversity Management Problem
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood decomposition search
- Variable neighborhood search for the p-median
Cited in
(16)- A hybrid artificial bee colony algorithm for the p-median problem with positive/negative weights
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
- A new method for managing the uncertainties in evaluating multi-person multi-criteria location choices, using a perceptual computer
- Some heuristic methods for solving p-median problems with a coverage constraint
- A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering
- Convex fuzzy \(k\)-medoids clustering
- An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- Emergency facility location under random network damage: insights from the Istanbul case
- A Lagrangian heuristic algorithm for a public healthcare facility location problem
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
- Discrete facility location in machine learning
- Learning to guide local search optimisation for routing problems
- A resonance neural network for the k-median problem
- A hybrid multistart heuristic for the uncapacitated facility location problem
- A branch and bound algorithm for determining locations of long-term care facilities
This page was built for publication: A fast swap-based local search procedure for location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480210)
