Discretization and resolution of the (r| X_ p)-medianoid problem involving quality criteria.
From MaRDI portal
Publication:703293
DOI10.1007/BF02578927zbMATH Open1148.90332OpenAlexW1979471412MaRDI QIDQ703293FDOQ703293
Rafael Suárez-Vega, P. Dorta González, D. R. Santos-Peñate
Publication date: 11 January 2005
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02578927
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Continuous location (90B85)
Cites Work
- Competitive Location Models: A Framework and Bibliography
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- On locating new facilities in a competitive environment
- Title not available (Why is that?)
- GBSSS: The generalized big square small square method for planar single- facility location
- Equity models in planar location
- Static competitive facility location: an overview of optimisation approaches.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Competitive spatial models
- Discretization results for the Huff and Pareto-Huff competitive location models on networks
- Title not available (Why is that?)
- Optimal sizes of facilities on a linear market
- The profit-maximizing weber problem
Cited In (15)
- 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
- 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
- Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem
- The leader-follower location model
- Locating facilities in a competitive environment
- Conditional Location Problems on Networks and in the Plane
- 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
- Robust model of discrete competitive facility location problem with partially proportional rule
- Improving solution of discrete competitive facility location problems
Recommendations
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
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)
