Ant Colony Optimization: Overview and Recent Advances [chapter]

Marco Dorigo, Thomas Stützle
2010 International Series in Operations Research and Management Science  
1 Other approximate methods are also conceivable. For example, when stopping exact methods, like Branch & Bound, before completion [10, 95] (for example, after some given time bound, or when some guarantee on the solution quality is obtained through the use of lower and upper bounds), we can convert exact algorithms into approximate ones.
doi:10.1007/978-1-4419-1665-5_8 fatcat:z3wifbfucbfxjonea6fxip2rba