Robust model of discrete competitive facility location problem with partially proportional rule
type: Item
instance of: scholarly article
title: Robust model of discrete competitive facility location problem with partially proportional rule
zbMATH Open document ID: 1544.90111
DOI: 10.1155/2020/3107431
author: Wuyang Yu
published in: Mathematical Problems in Engineering
publication date: 2021-05-18T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 7349106
MaRDI profile type: Publication
cites work: The leader-follower location model
cites work: A bibliography for some fundamental problem categories in discrete location science
cites work: Static competitive facility location: an overview of optimisation approaches.
cites work: An exact procedure and LP formulations for the leader-follower location problem
cites work: On planar medianoid competitive location problems with Manhattan distance
cites work: Finding the optimal solution to the Huff based competitive location model
cites work: Discretization results for the Huff and Pareto-Huff competitive location models on networks
cites work: Recent insights in Huff-like competitive facility location and design
cites work: A leader-follower model for discrete competitive facility location
cites work: The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane
cites work: Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
cites work: Q3971522
cites work: Models and algorithms for competitive facility location problems with different customer behavior
cites work: New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
cites work: A planar single-facility competitive location and design problem under the multi-deterministic choice rule
cites work: A competitive facility location problem on a tree network with stochastic weights.
cites work: An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: The Price of Robustness
cites work: Q3158276
cites work: Optimization by Simulated Annealing
cites work: Q4857376
description: scientific article; zbMATH DE number 7349106