UNIT V BACKTRACKING AND BRANCH-AND-BOUND Backtracking – N-Queens Problem – Hamiltonian Circuit Problem – Subset Sum Problem – Branch-and- Bound – Travelling Salesman Problem
| dc.contributor.author | . | |
| dc.date.accessioned | 2022-02-23T09:53:21Z | |
| dc.date.available | 2022-02-23T09:53:21Z | |
| dc.date.issued | 2019 | |
| dc.identifier.uri | http://10.10.11.6/handle/1/5035 | |
| dc.language.iso | en | en_US |
| dc.publisher | GALGOTIAS UNIVERSITY | en_US |
| dc.subject | Design and Analysis of Algorithms | en_US |
| dc.title | UNIT V BACKTRACKING AND BRANCH-AND-BOUND Backtracking – N-Queens Problem – Hamiltonian Circuit Problem – Subset Sum Problem – Branch-and- Bound – Travelling Salesman Problem | en_US |