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...
Saved in:
| Published in: | Yugoslav Journal of Operations Research Vol. 19; no. 1; pp. 3 - 40 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
University of Belgrade
2009
|
| Subjects: | |
| ISSN: | 0354-0243, 1820-743X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!