 Exact algorithms for handling outliers in center location problems on networks using k-max functionsTeresa Schnepper, Kathrin Klamroth, Michael Stiglmayr and Justo Puerto European Journal of Operational Research, 2019, vol. 273, issue 2, 441-451 Abstract: In this paper, the identification and exclusion of very distant facilities in center location problems is modeled by k-max functions: One or several new facilities are to be located such that not the largest, but the kth largest weighted distance to the customers is minimized, with k ≥ 1. It is shown that k-max location problems on networks can be solved efficiently by enumerating candidate solutions from a finite dominating set (FDS) that is independent from the particular value of k. As a consequence, k-max locations can be found for all reasonable values of k at little extra cost as compared to a single solver call, for one fixed value of k. The location of several new facilities is naturally more complex. An FDS based recursive algorithm is developed for this case that allows the exact solution of medium size instances. Keywords: Location theory; Center problem; Outlier; k-max function; Finite dominating set (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:273:y:2019:i:2:p:441-451 DOI: 10.1016/j.ejor.2018.08.030 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.