" Enhancements to Two Exact Algorithms for Solving the Vertex P-center Problem"
, A. Al-khedhairi . 2005
Abstract
Enhancements to two exact algorithms from the literature to solve the vertex P-center problem are proposed. In the first approach modifications of some steps are introduced to reduce the number of ILP iterations needed to find the optimal solution. In the second approach a simple enhancement which uses tighter initial lower and upper bounds, and a more appropriate binary search method are proposed to reduce the number of subproblems to be solved. These ideas are tested on two well known sets of problems from the literature (i.e., OR-Lib and TSP-Lib problems) with encouraging results.
This paper introduces an attempt to investigate the complex dynamics of a nonlinear duopoly game of players (firms) adopting prices as their decision variables. Two different models are introduced…
In this paper, we give a proper investigation of the problem of remanufacturing duopoly game. A smooth piecewise map is introduced to describe such game. A rich analysis either analytical or…
Memory effects play a critical role in complex immune systems. In this paper, the recent efficient and realistic Atangana–Baleanu fractional order derivative, with non-local and non-singular…