Heuristic procedures for solving the discrete ordered median problem
From MaRDI portal
Publication:816415
DOI10.1007/s10479-005-2043-3zbMath1105.90332OpenAlexW1965275731MaRDI QIDQ816415
Stefan Nickel, Pierre Hansen, Patricia Domínguez-Marín, Nenad Mladenović
Publication date: 9 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-13118
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A revised variable neighborhood search for the discrete ordered median problem, An extended covering model for flexible discrete and equity location problems, Genetic algorithms for solving the discrete ordered median problem, The ordered capacitated facility location problem, On solving the planar \(k\)-centrum problem with Euclidean distances, The probabilistic \(p\)-center problem: planning service for potential customers, Ordered \(p\)-median problems with neighbourhoods, A memetic algorithm for multi-objective dynamic location problems, A modified variable neighborhood search for the discrete ordered median problem, Efficient solutions for the far from most string problem, Variable neighbourhood search: methods and applications, Exact procedures for solving the discrete ordered median problem, Convex ordered median problem with \(\ell _p\)-norms, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, A flexible model and efficient solution strategies for discrete location problems, Variable neighbourhood search: Methods and applications, The ordered \(k\)-median problem: surrogate models and approximation algorithms, Distribution systems design with role dependent objectives, The \(p\)-facility ordered median problem on networks
Uses Software
Cites Work
- A note on solving large p-median problems
- Variable neighborhood search
- Variable neighborhood decomposition search
- Algorithmic results for ordered median problems
- A flexible approach to location problems
- Exact procedures for solving the discrete ordered median problem
- A New Formulation and Resolution Method for the p-Center Problem
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Variable neighborhood search for the p-median
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Aggregation Error Bounds for a Class of Location Models
- Multifacility ordered median problems on networks: A further analysis
- Variable neighborhood search: Principles and applications
- On the use of genetic algorithms to solve location problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
