p-median and p-dispersion problems: a bi-criteria analysis
From MaRDI portal
(Redirected from Publication:337587)
\(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
\(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
Recommendations
- scientific article; zbMATH DE number 4209907
- A computational study for the p-median problem
- Solution methods for thep-median problem: An annotated bibliography
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- A tighter formulation of the p-median problem
- On the conditional \(p\)-median problem
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- A comparison of two dual-based procedures for solving the p-median problem
- On the probabilistic analysis of an approximation algorithm for solving the \(p\)-median problem
- On an approach to the robustness in the case of the \(p\)-median problem
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 2160609 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Dual-Bounded Algorithm for the p-Median Problem
- A Maxmin Location Problem
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An Indirect Method for the Generalized k-Median Problem Applied to Lock-Box Location
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Analytical models for locating undesirable facilities
- Cluster Analysis: An Application of Lagrangian Relaxation
- Computational aspects of the maximum diversity problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- GRASP and path relinking for the max-min diversity problem
- Good solutions to discrete noxious location problems via metaheuristics
- Heuristic and Special Case Algorithms for Dispersion Problems
- Multiobjective Optimization
- Solution methods for thep-median problem: An annotated bibliography
- Technical Note—An Algorithm for the p-Median Problem
- The discrete p-dispersion problem
- Upper bounds and exact algorithms for \(p\)-dispersion problems
Cited in
(7)- Stability Of Solutions To The P-Median Problem Under Induced Data Error
- Multiobjective optimization for multimode transportation problems
- The balanced \(p\)-median problem with unitary demand
- Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
- An exact method for the bi-objective p-median max-sum diversity problem
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- A new formulation for the conditional p-median and p-center problems
This page was built for publication: \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337587)
