haku: @indexterm Algorithms / yhteensä: 403
viite: 29 / 403
| Tekijä: | Tovey, C. A. |
| Otsikko: | Tutorial on Computational Complexity |
| Lehti: | Interfaces
2002 : MAY-JUN, VOL. 32:3, p. 30-61 |
| Asiasana: | COMPLEXITY ANALYTICAL REVIEW ALGORITHMS |
| Kieli: | eng |
| Tiivistelmä: | Computational complexity measures how much work is required to solve different problems. It provides a useful classification tool for OR/MS practitioners, especially when tackling discrete deterministic problems. Use it to tell, in advance, whether a problem is easy or hard. Knowing this won't solve your problem, but it will help you to decide what kind of solution method is appropriate. Complexity analysis helps you to understand and deal with hard problems. It can pinpoint the nasty parts of your problem, alert you to a special structure you can take advantage of, and guide you to model more effectively. You will solve your problem better when you know the borders between hard and easy. Locating the difficulty can indicate where to aggregate, decompose, or simplify. |
SCIMA