haku: @indexterm ALGORITHMS / yhteensä: 403
viite: 213 / 403
| Tekijä: | Glover, F. Klingman, D. |
| Otsikko: | New sharpness properties, algorithms and complexity bounds for partitioning shortest path procedures. |
| Lehti: | Operations Research
1989 : JUL-AUG, VOL. 37:4, p. 542-546 |
| Asiasana: | ALGORITHMS |
| Kieli: | eng |
| Tiivistelmä: | Building on the framework of partitioning shortest path algorihtms, the results provide two new algorithms with different types of interesting sharpness properties that may be characterized by reference to a refinement of the sharpness concept. One of the new algorithms is shown to have a complexity bound that is superior to that of the previous algorithms with corresponding sharpness properties. The second new method is demonstrated to have a better bound while exhibiting sharpness properties that are nearly as comprehensive. Finally, methods are discussed for identifying negative cycles that exhibit a special time-sharp property. |
SCIMA