Oblivious and Non-oblivious Local Search for Combinatorial Optimization
Standard local search algorithms for combinatorial optimization problems repeatedly apply small changes to a current solution to improve the problem's given objective function. In contrast, non-oblivious local search algorithms are guided by an auxiliary potential function, which is distinct f...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_ca |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1807/34957 |