1 Ch 13 – Backtracking + Branch-and-Bound There are two principal approaches to tackling NP-hard problems or other “intractable” problems: Use a strategy.
Algorithms: An Introduction
The Theory of NP-Completeness
Algorithms: An Introduction Section 3.1 of Rosen Spring 2011 CSCE 235 Introduction to Discrete Structures Course web-page: cse.unl.edu/~cse235 Questions:
