A modified variable neighborhood search for the discrete ordered median problem
From MaRDI portal
Publication:2256171
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
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 1859298 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- scientific article; zbMATH DE number 1394671 (Why is no real title available?)
- A flexible approach to location problems
- A flexible model and efficient solution strategies for discrete location problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An extended covering model for flexible discrete and equity location problems
- Developments of variable neighborhood search
- Distribution systems design with role dependent objectives
- Exact procedures for solving the discrete ordered median problem
- Genetic algorithms for solving the discrete ordered median problem
- Heuristic procedures for solving the discrete ordered median problem
- Single-allocation ordered median hub location problems
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- The ordered capacitated facility location problem
- Variable neighborhood decomposition search
- Variable neighborhood search
- Variable neighborhood search for the p-median
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: methods and applications
Cited in
(14)- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- Variable neighborhood search for the p-median
- 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
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)
