Content deleted Content added
Fixed an incorrect statement that was too broad. |
No edit summary |
||
Line 1:
In [[computer science]] and [[operations research]], '''exact algorithms''' are [[algorithm]]s that always solve an optimization problem to optimality.
Optimal solution can be the ral solution nor the visible solution
Unless [[P = NP]], an exact algorithm for an [[NP-hardness | NP-hard]] optimization problem cannot run in worst-case [[polynomial time]]. There has been extensive research on finding exact algorithms whose running time is exponential with a low base.<ref>{{citation
| |||