An overview on polynomial approximation of NP-hard problems
The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between computational time and solution's qualit...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Belgrade
2009-01-01
|
| Series: | Yugoslav Journal of Operations Research |
| Subjects: | |
| Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2009/0354-02430901003P.pdf |