Genetic algorithms for solving the discrete ordered median problem
From MaRDI portal
Publication:884020
DOI10.1016/j.ejor.2006.09.069zbMath1121.90087OpenAlexW2037160560MaRDI QIDQ884020
Jozef Kratica, Zorica Stanimirović, Djordje Dugošija
Publication date: 13 June 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.069
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (15)
A revised variable neighborhood search for the discrete ordered median problem ⋮ Computing the metric dimension of graphs by genetic algorithms ⋮ An exact completely positive programming formulation for the discrete ordered median problem: an extended version ⋮ The ordered capacitated facility location problem ⋮ Ordered \(p\)-median problems with neighbourhoods ⋮ PCB assembly scheduling with alternative nozzle types for one component type ⋮ A modified variable neighborhood search for the discrete ordered median problem ⋮ An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem ⋮ A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms ⋮ Computing minimal doubly resolving sets of graphs ⋮ A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms ⋮ Variable Neighborhood Search for Solving the Balanced Location Problem ⋮ Distribution systems design with role dependent objectives ⋮ Metaheuristic applications on discrete facility location problems: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristic procedures for solving the discrete ordered median problem
- The discrete ordered median problem: Models and solution methods.
- Obtaining test problems via Internet
- 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
This page was built for publication: Genetic algorithms for solving the discrete ordered median problem