Lower bounds for the axial three-index assignment problem |
| |
| Authors: | Bum-Jin Kim William L Hightower Peter M Hahn Yi-Rong Zhu Lu Sun |
| |
| Institution: | aElectrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA 19104-6315, USA;bSCM Consulting Team, Samsung SDS Co., Ltd., Republic of Korea;cMathematics and Computer Science, High Point University High Point, NC 27262, USA;dCivil Engineering, Catholic University of America, WA, DC 20064, USA |
| |
| 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 |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
