scientific article; zbMATH DE number 1253050
From MaRDI portal
Publication:4229616
Recommendations
- Some heuristic methods for solving p-median problems with a coverage constraint
- A branch-and-price approach to p-median location problems
- A note on solving large p-median problems
- P-median problems with an additional constraint on the assignment variables
- Computational study of large-scale p-median problems
Cited in
(13)- A new formulation for the conditional p-median and p-center problems
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- Some heuristic methods for solving p-median problems with a coverage constraint
- The ordered anti-median problem with distances derived from a strictly convex norm
- Approximation algorithm for uniform bounded facility location problem
- Metaheuristic applications on discrete facility location problems: a survey
- Approximation algorithm for the uniform bounded facility problem
- m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
- scientific article; zbMATH DE number 1253053 (Why is no real title available?)
- Relevant Network Distances for Approximate Approach to Large p-Median Problems
- A new method for solving capacitated location problems based on a set partitioning approach
- Unmanned aerial vehicle variable radius set covering problem for emergency wireless network
- The directional \(p\)-median problem: definition, complexity, and algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229616)
