haku: @author Balas, E. / yhteensä: 5
viite: 2 / 5
| Tekijä: | Balas, E. Saltzman, M. J. |
| Otsikko: | An algorithm for the three-index assignment problem. |
| Lehti: | Operations Research
1991 : JAN-FEB, VOL. 39:1, p. 150-161 |
| Asiasana: | BRANCH AND BOUND METHODS ALGORITHMS INTEGER PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | An algorithm for the axial three-index assignment problem is presented. The algorithm includes a Lagrangian relaxation that incorporates a class of fact inequalities and is solved by a modified subgradient procedure to find good lower bounds, a primal heuristic based on the principle of minimizing maximum regret plus a variable depth interchange phase for finding good upper bounds, and a novel branching strategy that exploits problem structure to fix several variables at each node and reduce the size of the total enumeration three. Results of computational experiments with an implementation of the algorithm are presented. |
SCIMA