A modified variable neighborhood search for the discrete ordered median problem
From MaRDI portal
Publication:2256171
DOI10.1016/J.EJOR.2013.09.029zbMATH Open1305.90257OpenAlexW2016381117WikidataQ58217135 ScholiaQ58217135MaRDI QIDQ2256171FDOQ2256171
Authors: Justo Puerto, Dionisio Pérez-Brito, Carlos G. García-González 
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
Recommendations
- Heuristic procedures for solving the discrete ordered median problem
- A revised variable neighborhood search for the discrete ordered median problem
- The discrete ordered median problem: Models and solution methods.
- Exact procedures for solving the discrete ordered median problem
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
Cites Work
- Genetic algorithms for solving the discrete ordered median problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variable neighborhood search
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: methods and applications
- Single-allocation ordered median hub location problems
- The ordered capacitated facility location problem
- Developments of variable neighborhood search
- Variable neighborhood decomposition search
- An extended covering model for flexible discrete and equity location problems
- Variable neighborhood search for the p-median
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- A flexible model and efficient solution strategies for discrete location problems
- A flexible approach to location problems
- Exact procedures for solving the discrete ordered median problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distribution systems design with role dependent objectives
- Heuristic procedures for solving the discrete ordered median problem
Cited In (14)
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Variable neighborhood search for the p-median
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- A revised variable neighborhood search for the discrete ordered median problem
- The probabilistic \(p\)-center problem: planning service for potential customers
- Ordered \(p\)-median problems with neighbourhoods
- Continuous multifacility ordered median location problems
- Heuristic procedures for solving the discrete ordered median problem
- Optimization problems with flexible objectives: a general modeling approach and applications
- A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA-VNS algorithm
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Genetic algorithms for solving the discrete ordered median problem
- A parallelized lagrangean relaxation approach for the discrete ordered median problem
- Improved heuristics for solving large-scale scanning transmission electron microscopy image segmentation using the ordered median problem
Uses Software
This page was built for publication: A modified variable neighborhood search for the discrete ordered median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256171)
