Paper Info
Title
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location
Abstract
The multiple obnoxious facilities location problem is an extremely non-convex optimization problem with millions of local optima. It is a very challenging problem. We improved the best known solution for 33 out of 76 test instances. We believe that the results of many instances reported here are still not optimal and thus better objective function values exist. We challenge the optimization community to design procedures that will further improve some of the results reported here. Optimality can be proven for a small number of new facilities. Proving optimality for a large number of facilities would be an achievement.
Year
DOI
Venue
2022
10.1007/s11590-021-01731-2
Optimization Letters
Keywords
DocType
Volume
Obnoxious facilities, Local search, Starting solutions, Heuristics
Journal
16
Issue
ISSN
Citations 
4
1862-4472
0
PageRank 
References 
Authors
0.34
2
2
Name
Order
Citations
PageRank
Pawel Kalczynski100.34
Zvi Drezner21195140.69