A combined model for chain expansion including the possibility of locating a new facility and modification and/or closing of existing facilities

The problem of an expanding chain (it already has some facilities) in a given area is considered. It may locate a new facility, or vary (up or down) the quality of its existing facilities, or close some of them, or a combination of all those possibilities, whatever it is the best to maximize its profit, … Read more

On monotonicity and search traversal in copositivity detection algorithms

Matrix copositivity has an important theoretical background. Over the last decades, the use of algorithms to check copositivity has made a big progress. Methods are based on spatial branch and bound, transformation to Mixed Integer Programming, implicit enumeration of KKT points or face-based search. Our research question focuses on exploiting the mathematical properties of the … Read more

p-facility Huff location problem on networks

The p-facility Huff location problem aims at locating facilities on a competitive environment so as to maximize the market share. While it has been deeply studied in the field of continuous location, in this paper we study the p-facility Huff location problem on networks formulated as a Mixed Integer Nonlinear Programming problem that can be … Read more

Maximal Covering Location Problems on networks with regional demand

Covering problems are well studied in the Operations Research literature under the assumption that both the set of users and the set of potential facilities are finite. In this paper we address the following variant, which leads to a Mixed Integer Nonlinear Program (MINLP): locations of p facilities are sought along the edges of a … Read more

Solving a Huff-like Stackelberg problem on networks

This work deals with a Huff-like Stackelberg problem, where the leader facility wants to decide its location so that its profit is maximal after the competitor (the follower) also built its facility. It is assumed that the follower makes a rational decision, maximizing their profit. The inelastic demand is aggregated into the vertices of a … Read more

Sensitivity analysis of the optimal solutions to Huff-type competitive location and design problems

A chain wants to set up a single new facility in a planar market where similar facilities of competitors, and possibly of its own chain, are already present. Fixed demand points split their demand probabilistically over all facilities in the market proportionally with their attraction to each facility, determined by the different perceived qualities of … Read more