p-median and p-dispersion problems: a bi-criteria analysis
DOI10.1016/J.COR.2015.02.007zbMATH Open1348.90420OpenAlexW2007855628WikidataQ57436474 ScholiaQ57436474MaRDI QIDQ337587FDOQ337587
Authors: Fatemeh Sayyady, Golbarg K. Tutunchi, Yahya Fathi 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.02.007
Recommendations
- scientific article
- 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
Multi-objective and goal programming (90C29) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Title not available (Why is that?)
- Solution methods for thep-median problem: An annotated bibliography
- Analytical models for locating undesirable facilities
- A Dual-Based Procedure for Uncapacitated Facility Location
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- The discrete p-dispersion problem
- GRASP and path relinking for the max-min diversity problem
- Computational aspects of the maximum diversity problem
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- A Maxmin Location Problem
- Heuristic and Special Case Algorithms for Dispersion Problems
- Multiobjective Optimization
- Good solutions to discrete noxious location problems via metaheuristics
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- Cluster Analysis: An Application of Lagrangian Relaxation
- A Dual-Bounded Algorithm for the p-Median Problem
- An Indirect Method for the Generalized k-Median Problem Applied to Lock-Box Location
- Technical Note—An Algorithm for the p-Median Problem
- Title not available (Why is that?)
Cited In (5)
- Stability Of Solutions To The P-Median Problem Under Induced Data Error
- Multiobjective optimization for multimode transportation problems
- Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
- 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
Uses Software
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)
