Oblivious and Non-oblivious Local Search for Combinatorial Optimization

Oblivious and Non-oblivious Local Search for Combinatorial Optimization

Show other versions (1)

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...

Full description

Bibliographic Details
Main Author: Ward, Justin
Other Authors: Borodin, Allan
Language:en_ca
Published: 2012
Subjects:
Approximation Algorithms
Local Search
Submodular Maximization
Independence Systems
0984
Online Access:http://hdl.handle.net/1807/34957

Internet

http://hdl.handle.net/1807/34957

Similar Items