haku: @author Toth, P. / yhteensä: 13
viite: 5 / 13
| Tekijä: | Fischetti, M. Toth, P. |
| Otsikko: | An additive bounding procedure for combinatorial optimization problems. |
| Lehti: | Operations Research
1989 : MAR-APR, VOL. 37:2, p. 319-328 |
| Asiasana: | TRAVELLING SALESMAN PROBLEM BRANCH AND BOUND METHODS LINEAR PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | The effectiveness of the branch-and bound algorithms proposed for the solution of combinatorial optimization problems greatly depends on fast procedures that provide tight bounds on the optimum value of the problem. An additive approach is described to design bounding procedures that yield an increasing sequence of values for optimization problems with a linear objective function. The idea is to exploit different bounding procedures to obtain a tighter bound. An application to the traveling salesman problem with precedence constraints and a numerical example that exemplify the new approach are given. |
SCIMA