Upper bounds for objective functions of discrete competitive facility location problems

2009 ◽  
Vol 3 (4) ◽  
pp. 419-432 ◽  
Author(s):  
V. L. Beresnev
Keyword(s):  
Facility Location ◽  
Upper Bounds ◽  
Location Problems ◽  
Objective Functions ◽  
Facility Location Problems ◽  
Competitive Facility Location

Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations

2020 ◽  
Vol 24 (23) ◽  
pp. 17705-17713 ◽  
Author(s):  
Algirdas Lančinskas ◽  
Julius Žilinskas ◽  
Pascual Fernández ◽  
Blas Pelegrín
Keyword(s):  
Facility Location ◽  
Location Problems ◽  
Facility Location Problems ◽  
Competitive Facility Location

scholarly journals Aggregation and non aggregation techniques for large facility location problems: A survey

2015 ◽  
Vol 25 (3) ◽  
pp. 313-341 ◽  
Author(s):  
Chandra Irawan ◽  
Said Salhi
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Location Problems ◽  
Objective Functions ◽  
Facility Location Problems ◽  
Aggregation Techniques ◽  
Number Of Customers

A facility location problem is concerned with determining the location of some useful facilities in such a way so to fulfil one or a few objective functions and constraints. We survey those problems where, in the presence of a large number of customers, some form of aggregation may be required. In addition, a review on conditional location problems where some (say q) facilities already exist in the study area is presented.

scholarly journals Facility location via continuous optimization with discontinuous objective functions

2007 ◽  
Vol 48 (3) ◽  
pp. 315-325 ◽  
Author(s):  
J. Ugon ◽  
S. Kouhbor ◽  
M. Mammadov ◽  
A. Rubinov ◽  
A. Kruger
Keyword(s):  
Global Optimization ◽  
Facility Location ◽  
Continuous Optimization ◽  
Optimization Methods ◽  
Optimization Method ◽  
Location Problems ◽  
Objective Functions ◽  
Global Optimization Method ◽  
Facility Location Problems ◽  
Real World Application

AbstractFacility location problems are one of the most common applications of optimization methods. Continuous formulations are usually more accurate, but often result in complex problems that cannot be solved using traditional optimization methods. This paper examines theuse of a global optimization method—AGOP—for solving location problems where the objective function is discontinuous. This approach is motivated by a real-world application in wireless networks design.

Improving solution of discrete competitive facility location problems

2015 ◽  
Vol 11 (2) ◽  
pp. 259-270 ◽  
Author(s):  
Algirdas Lančinskas ◽  
Pascual Fernández ◽  
Blas Pelegín ◽  
Julius Žilinskas
Keyword(s):  
Facility Location ◽  
Location Problems ◽  
Facility Location Problems ◽  
Competitive Facility Location
Sign in / Sign up

Export Citation Format

Share Document