On a class of subadditive duals for the uncapacitated facility location problem

Ehsan Monabbati and Hossein Taghizadeh Kakhki

Applied Mathematics and Computation, 2015, vol. 251, issue C, 118-131

Abstract: A family of subadditive functions which contains the optimal solution of subadditive duals for integer programs has been presented by Klabjan (2007). In this paper we present a subadditive dual ascent procedure to find an optimal subadditive dual function based on Klabjan’s generator subadditive function. Then we use the proposed method to solve the so called uncapacitated facility location problem (UFLP). Establishing an explicit formulation for generator subadditive functions in the columns of the coefficient matrix of the UFLP, we derive some variable fixing rules for the problem. Some computational results are also presented.

Keywords: Uncapacitated facility location problem; Subadditive dual; Integer programming; Exact methods; Variable fixing (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314014477
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:251:y:2015:i:c:p:118-131

DOI: 10.1016/j.amc.2014.10.072

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().