Discretization and resolution of the (r| X_ p)-medianoid problem involving quality criteria.
From MaRDI portal
Publication:703293
Recommendations
- p-median and p-dispersion problems: a bi-criteria analysis
- scientific article; zbMATH DE number 1985685
- Solving discretely constrained mixed complementarity problems using a median function
- Approximate solution of the \(p\)-median minimization problem
- A tighter formulation of the p-median problem
- On an approach to the robustness in the case of the \(p\)-median problem
- scientific article; zbMATH DE number 4209907
- On the linear relaxation of the \(p\)-median problem
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
Cites work
- scientific article; zbMATH DE number 9247 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 1253053 (Why is no real title available?)
- scientific article; zbMATH DE number 1323030 (Why is no real title available?)
- Competitive Location Models: A Framework and Bibliography
- Competitive spatial models
- Discretization results for the Huff and Pareto-Huff competitive location models on networks
- Equity models in planar location
- GBSSS: The generalized big square small square method for planar single- facility location
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- On locating new facilities in a competitive environment
- Optimal sizes of facilities on a linear market
- Static competitive facility location: an overview of optimisation approaches.
- The profit-maximizing weber problem
Cited in
(18)- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- A logistics provider's profit maximization facility location problem with random utility maximizing followers
- Estimating the Pareto front of a hard bi-criterion competitive facility location problem
- Sequential competitive location on networks
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- The leader-follower location model
- Locating facilities in a competitive environment
- Conditional Location Problems on Networks and in the Plane
- A simple and effective exact method for the medianoid problem with multipurpose trips
- The \((r|X_p)\)-medianoid model for non-essential services and proportional preferences with attraction functions
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- Isodistant points in competitive network facility location
- A continuum perspective of customer choice rules for competitive facility location problems
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- On planar medianoid competitive location problems with Manhattan distance
- Robust model of discrete competitive facility location problem with partially proportional rule
- Improving solution of discrete competitive facility location problems
This page was built for publication: Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703293)
