Local Search: Difference between revisions
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
* [[NP_Completeness#Subjects|NP Completeness]] | * [[NP_Completeness#Subjects|NP Completeness]] | ||
=Overview= | =Overview= | ||
<font color=darkkhaki>TODO.</font> | |||
=Local Search Algorithms= | =Local Search Algorithms= | ||
* [[The Maximum Cut Problem#Overview|The Maximum Cut Problem]] | * [[The Maximum Cut Problem#Overview|The Maximum Cut Problem]] | ||
* [[The 2SAT Problem]] | * [[The 2SAT Problem]] | ||
Revision as of 04:09, 30 November 2021
External
- https://www.coursera.org/learn/algorithms-npcomplete/lecture/mT2vp/principles-of-local-search-i
- https://www.coursera.org/learn/algorithms-npcomplete/lecture/gBJy8/principles-of-local-search-ii
Internal
Overview
TODO.