A modified firefly algorithm for general inverse p-Median location problems under different distance norms
From MaRDI portal
Publication:1788861
Recommendations
- A modified particle swarm optimization algorithm for general inverse ordered p-median location problem on networks
- Inverse median problems
- Inverse median location problems with variable coordinates
- Inverse 1-median problem on trees under weighted \(l _{ \infty }\) norm
- Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
Cites work
- 2-balanced flows and the inverse 1-median problem in the Chebyshev space
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
- A genetic algorithm for the p-median problem with pos/neg weights
- A linear time algorithm for inverse obnoxious center location problems on networks
- A modified variable neighborhood search for the discrete ordered median problem
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
- Firefly Algorithms for Multimodal Optimization
- Genetic algorithms for solving the discrete ordered median problem
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- Inverse 1-center location problems with edge length augmentation on trees
- Inverse 1-median problem on block graphs with variable vertex weights
- Inverse p-median problems with variable edge lengths
- Inverse center location problem on a tree
- Inverse median location problems with variable coordinates
- Inverse median problems
- New heuristic algorithms for solving the planar p-median problem
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- The \(p\)-median problem: a survey of metaheuristic approaches
- The complexity analysis of the inverse center location problem
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- The inverse 1-maxian problem with edge length modification
- The inverse 1-median problem on a cycle
- The inverse 1-median problem on a tree and on a path
- The inverse 1-median problem on tree networks with variable real edge lengths
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- The inverse Fermat-Weber problem
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
Cited in
(14)- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- The inverse 1-center problem on cycles with variable edge lengths
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
- A modified particle swarm optimization algorithm for general inverse ordered p-median location problem on networks
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- On some inverse 1-center location problems
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
- The reverse selective balance center location problem on trees
- A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment
- A \textit{tri}-level minimum information demand estimation model to the inverse \(p\)-median problem
- Budget-constrained inverse median facility location problem on tree networks
This page was built for publication: A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1788861)
