Lower bounds for the axial three-index assignment problem

Bum-Jin Kim, William L. Hightower, Peter M. Hahn, Yi-Rong Zhu and Lu Sun

European Journal of Operational Research, 2010, vol. 202, issue 3, 654-668

Abstract: This paper describes new bounding methods for the axial three-index assignment problem (3AP). For calculating 3AP lower bounds, we use a projection method followed by a Hungarian algorithm, based on a new Lagrangian relaxation. We also use a cost transformation scheme, which iteratively transforms 3AP costs in a series of equivalent 3APs, which provides the possibility of improving the 3AP lower bound. These methods produce efficiently computed relatively tight lower bound.

Keywords: Axial; 3-index; assignment; Lower; bounds; Integer; programming (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00487-1
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:ejores:v:202:y:2010:i:3:p:654-668

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
Bibliographic data for series maintained by Catherine Liu ().