Content deleted Content added
←Created page with 'In computer science and operations research, '''exact algorithms''' are algorithms that always solve an optimization problem to optimality. Developin...' |
Added references section. |
||
Line 1:
In [[computer science]] and [[operations research]], '''exact algorithms''' are [[algorithm]]s that always solve an optimization problem to optimality. Developing a fast exact algorithm for NP-hard optimization problems, such as [[vehicle routing problem]], is a notorious open problem<ref>{{cite web|last1=Laporte, Gilbert. "The vehicle routing problem: An overview of exact and approximate algorithms." European Journal of Operational Research 59.3 (1992): 345-358.}}</ref><ref>{{cite web|last1=Paulusma|first1=D|title=Exact algorithms for NP-hard problems|url=http://gow.epsrc.ac.uk/NGBOViewGrant.aspx?GrantRef=EP/D053633/1}}</ref>.
== See also ==
Line 8 ⟶ 6:
* [[Polynomial-time approximation scheme|PTAS]] - a type of approximation algorithm that takes the approximation ratio as a parameter
==References==
{{reflist}}
[[Category:Computational complexity theory]]
| |||