Genetic algorithms for solving the discrete ordered median problem
From MaRDI portal
Recommendations
- Heuristic procedures for solving the discrete ordered median problem
- New genetic algorithms based approaches to continuous \(p\)-median problem
- A modified variable neighborhood search for the discrete ordered median problem
- An efficient genetic algorithm for the uncapacitated multiple allocation \(p\)-hub median problem
- The discrete ordered median problem: Models and solution methods.
Cites work
- scientific article; zbMATH DE number 1737515 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 2172799 (Why is no real title available?)
- scientific article; zbMATH DE number 1859298 (Why is no real title available?)
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Exact procedures for solving the discrete ordered median problem
- Heuristic procedures for solving the discrete ordered median problem
- Obtaining test problems via Internet
- The discrete ordered median problem: Models and solution methods.
- Variable neighborhood search for the p-median
Cited in
(21)- Metaheuristic applications on discrete facility location problems: a survey
- scientific article; zbMATH DE number 1138446 (Why is no real title available?)
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Variable neighborhood search for solving the balanced location problem
- Tuned genetic algorithms for finding p-medians of a weighted graph
- 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
- scientific article; zbMATH DE number 2040689 (Why is no real title available?)
- A revised variable neighborhood search for the discrete ordered median problem
- The ordered capacitated facility location problem
- Computing the metric dimension of graphs by genetic algorithms
- Ordered \(p\)-median problems with neighbourhoods
- Computing minimal doubly resolving sets of graphs
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version
- Heuristic procedures for solving the discrete ordered median problem
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
- Distribution systems design with role dependent objectives
- PCB assembly scheduling with alternative nozzle types for one component type
- scientific article; zbMATH DE number 1803759 (Why is no real title available?)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- A modified variable neighborhood search for the discrete ordered median problem
This page was built for publication: Genetic algorithms for solving the discrete ordered median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884020)