-
Article
Upper Bound for the Competitive Facility Location Problem with Demand Uncertainty
We consider a competitive facility location problem with two competing parties operating in a situation of uncertain demand scenarios. The problem of finding the best solutions for the parties is formulated as...
-
Article
Additional Constraints for Dynamic Competitive Facility Location Problem
We consider a competitive facility location model where competing parties (Leader and Follower) make decisions considering changes of the set of customers happening during the planing horizon consisting a kno...
-
Article
Computation of an Upper Bound in the Two-Stage Bilevel Competitive Location Model
We consider a competitive facility location problem with uncertainty represented by a finite number of possible demand scenarios. The problem is stated as a bilevel model constructed on the basis of a Stackel...
-
Article
Planning a Defense That Minimizes a Resource Deficit in the Worst-Case Scenario of Supply Network Destruction
We consider same model of planning the defense of edges of a supply network. The vertices of the network represent the consumers and the providers of a resource, while the edges allow us to transmit the resou...
-
Article
A Bilevel “Attacker-Defender” Model to Choosing the Composition of Attack Means
We consider a bilevel model of estimating the costs of the attacking party (the Attacker) for a successful attack of a given set of objects protected by the other party (the Defender). The Attacker and the Def...
-
Article
A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition
We consider a mathematical model of market competition between two parties. The parties sequentially bring their products to the market while aiming to maximize profit. The model is based on the Stackelberg ga...
-
Article
Bilevel “Defender–Attacker” Model with Multiple Attack Scenarios
We consider a bilevel “defender-attacker” model built on the basis of the Stackelberg game. In this model, given is a set of the objects providing social services for a known set of customers and presenting po...
-
Article
Cut Generation Algorithm for the Discrete Competitive Facility Location Problem
A competitive facility location model formulated as a bilevel programming problem is considered. A new approach to the construction of estimating problems for bilevel competitive location models is proposed. A...
-
Article
An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
A new mathematical model is considered related to competitive location problems where two competing parties, the Leader and the Follower, successively open their facilities and try to win customers. In the mod...
-
Chapter and Conference Paper
Upper Bound for the Capacitated Competitive Facility Location Problem
We consider the capacitated competitive facility location problem (CCFLP) where two competing firms open facilities to maximize their profits obtained from customer service. The decision making process is orga...
-
Article
A capacitated competitive facility location problem
We consider a mathematical model similar in a sense to competitive location problems. There are two competing parties that sequentially open their facilities aiming to “capture” customers and maximize profit. ...
-
Article
On the competitive facility location problem with a free choice of suppliers
We consider a mathematical model from the class of competitive sequential facility location problems. In these problems, the competitors sequentially open their facilities, and each side aims to “capture” the ...
-
Article
The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
In the mathematical model under study, the two competing sides consecutively place their facilities aiming to capture consumers and maximize profits. The model amounts to a bilevel integer programming problem....
-
Article
Local search algorithms for the problem of competitive location of enterprises
This article deals with the mathematical model that generalizes the known problem of location of enterprises and is represented in the form of the problem of bilevel mathematical programming. In this model two...
-
Article
Local search with a generalized neighborhood in the optimization problem for pseudo-Boolean functions
In the optimization problem for pseudo-Boolean functions we consider a local search algorithm with a generalized neighborhood. This neighborhood is constructed for a locally optimal solution and includes nearb...
-
Article
Approximate algorithms for the competitive facility location problem
We consider the competitive facility location problem in which two competing sides (the Leader and the Follower) open in succession their facilities, and each consumer chooses one of the open facilities basing...
-
Article
A mathematical model of market competition
We consider a mathematical model of decision making by a company attempting to win a market share. We assume that the company releases its products to the market under the competitive conditions that another c...
-
Article
Upper bounds for objective functions of discrete competitive facility location problems
Under study is the problem of locating facilities when two competing companies successively open their facilities. Each client chooses an open facility according to his own preferences and return interests to ...
