Vis enkel innførsel

dc.contributor.authorBelik, Ivan
dc.contributor.authorJörnsten, Kurt
dc.date.accessioned2014-12-11T12:12:41Z
dc.date.available2014-12-11T12:12:41Z
dc.date.issued2014-01
dc.identifier.issn1500-4066
dc.identifier.urihttp://hdl.handle.net/11250/227006
dc.description.abstractRecently Beltrán-Royo, Vial & Alonso-Ayuso (2012) presented a semi-Lagrangean relaxation for the classical p-median location problem and for the incapacitated facility location problem. The results, obtained using the semi-Lagrangean relaxation approach, were quite impressive. In this paper we use a semi-Lagrangean relaxation to obtain an efficient solution method for the kcardinality assignment problem. The method has only one semi-Lagrangean multiplier that can only take on a limited number of values, making the search for the optimal multiplier easy. Since the semi-Lagrangean relaxation closes the duality gap, this leads to an extremely reliable and easily implementable method for finding k-cardinality assignments in large-scale cases. The method is computationally tested on the examples commonly used in the literature.nb_NO
dc.language.isoengnb_NO
dc.publisherFORnb_NO
dc.relation.ispartofseriesDiscussion paper;01/14
dc.subjectk-cardinality assignmentnb_NO
dc.subjectlagrangean relaxationnb_NO
dc.subjectmathematical programmingnb_NO
dc.titleA New Semi-Lagrangean Relaxation for the K-Cardinality Assignment Problemnb_NO
dc.typeWorking papernb_NO


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel