A fast swap-based local search procedure for location problems
From MaRDI portal
Publication:2480210
DOI10.1007/s10479-006-0154-0zbMath1144.90438OpenAlexW2109691905MaRDI QIDQ2480210
Renato F. Werneck, Mauricio G. C. Resende
Publication date: 31 March 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0154-0
Related Items
Emergency facility location under random network damage: insights from the Istanbul case, A hybrid multistart heuristic for the uncapacitated facility location problem, A Lagrangian heuristic algorithm for a public healthcare facility location problem, An efficient heuristic algorithm for the capacitated \(p\)-median problem, Some heuristic methods for solving \(p\)-median problems with a coverage constraint, A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights, Discrete facility location in machine learning, The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches, Convex fuzzy \(k\)-medoids clustering, An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems, A new method for managing the uncertainties in evaluating multi-person multi-criteria location choices, using a perceptual computer, A branch and bound algorithm for determining locations of long-term care facilities, A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering, An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on solving large p-median problems
- An efficient tabu search procedure for the \(p\)-median problem
- Heuristic concentration: Two stage solution construction
- Stabilized column generation
- Heuristic methods for large centroid clustering problems
- A branch-and-price approach to \(p\)-median location problems
- A hybrid heuristic for the \(p\)-median problem
- Variable neighborhood decomposition search
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A Dual-Bounded Algorithm for the p-Median Problem
- TSPLIB—A Traveling Salesman Problem Library
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Mersenne twister
- Variable neighborhood search for the p-median
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Local search heuristic for k-median and facility location problems
- The Optimal Diversity Management Problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
