haku: @indexterm NUMERICAL COMPUTATION / yhteensä: 22
viite: 4 / 22
| Tekijä: | Chan, T. J. Yano, C. A. |
| Otsikko: | A multiplier adjustment approach for the set partitioning problem |
| Lehti: | Operations Research
1992 : JAN-FEB, VOL. 40:SUP.1, p.S40-S47 |
| Asiasana: | BRANCH AND BOUND METHODS NUMERICAL COMPUTATION ALGORITHMS PROBLEM SOLVING |
| Kieli: | eng |
| Tiivistelmä: | An effective branch-and-bound algorithm for solving the set partitioning problem is developed. The method employs a new multiplier-adjustment-based bounding procedure, and a complementary branching strategy which results in relatively small search trees. Computational results indicate that the new algorithm is on average 16,6 times faster than the popular code, SETPAR. The improvements are mainly due to the bounding procedure , which is fast, easy to use, and provides tight lower bounds. The technique of variable elimination, which is very effective in reducing the size of the problems, is also applied. |
SCIMA