A modified variable neighborhood search for the discrete ordered median problem
From MaRDI portal
Publication:2256171
DOI10.1016/j.ejor.2013.09.029zbMath1305.90257WikidataQ58217135 ScholiaQ58217135MaRDI QIDQ2256171
Dionisio Perez-Britos, Carlos G. García-González, Justo Puerto
Publication date: 19 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.09.029
90B80: Discrete location and assignment
Related Items
Continuous multifacility ordered median location problems, A parallelized lagrangean relaxation approach for the discrete ordered median problem, A revised variable neighborhood search for the discrete ordered median problem, The probabilistic \(p\)-center problem: planning service for potential customers, Optimization problems with flexible objectives: a general modeling approach and applications, A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms, A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA-VNS algorithm, The ordered \(k\)-median problem: surrogate models and approximation algorithms, Ordered \(p\)-median problems with neighbourhoods, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
Uses Software
Cites Work
- The ordered capacitated facility location problem
- Single-allocation ordered median hub location problems
- Heuristic procedures for solving the discrete ordered median problem
- Genetic algorithms for solving the discrete ordered median problem
- Variable neighbourhood search: methods and applications
- A flexible model and efficient solution strategies for discrete location problems
- Distribution systems design with role dependent objectives
- Variable neighborhood search
- Variable neighborhood decomposition search
- A flexible approach to location problems
- An extended covering model for flexible discrete and equity location problems
- Exact procedures for solving the discrete ordered median problem
- 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
- Variable neighborhood search: Principles and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
