How to solve NP-hard problems
{"Image DocumentName": "How to solve NP-hard problems", "Image ImageDescription": "Irony of NP-hardness: It is often easier to find the best way of solving an NP-hard problem than the best way of solving a problem in P, because you know which approaches (not) to try. Algorithmic patterns for NP-hard problems: branch-and-bound, branch-and-cut, branch-and- reduce. Alternative approach if exact solutions are too hard to obtain: Solve the problem approximately.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}