unit2
Uploaded by
deeppati800unit2
Uploaded by
deeppati800Algorithmic Strategies and Heuristics
Fundamental Algorithmic Strategies: Brute-Force, Greedy,
Dynamic Programming, Branch and- Bound and Backtracking
methodologies for the design of algorithms; Illustrations of
these techniques for Problem-Solving, Bin Packing, Knap
Sack TSP. Heuristics –characteristics and their application
domains.
Here's a structured overview of the fundamental algorithmic strategies with examples like Bin
Packing, Knapsack, and Travelling Salesman Problem (TSP), along with a note on heuristics and their
characteristics:
🔹 1. Brute-Force Approach
Definition: Tries all possible solutions and selects the best one.
Characteristics:
Simple but inefficient.
Guarantees correctness.
Examples:
TSP: Check all permutations of cities and select the shortest.
Knapsack: Try all subsets of items.
Bin Packing: Try all arrangements of items in bins.
🔹 2. Greedy Algorithm
Definition: Makes the best choice at each step, hoping for a global optimum.
Characteristics:
Fast and simple.
Doesn’t always guarantee an optimal solution.
Examples:
Knapsack (Fractional): Pick items with highest value-to-weight ratio.
Bin Packing: First-Fit, Best-Fit strategies.
TSP: Nearest neighbor heuristic.
🔹 3. Dynamic Programming (DP)
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 1/3
Definition: Solves problems by combining solutions of subproblems and storing intermediate
results (memoization).
Characteristics:
Optimal substructure.
Overlapping subproblems.
Examples:
0/1 Knapsack: Use a DP table to track max value for capacities.
TSP (Held-Karp): Solve using bitmasking and DP.
Bin Packing: Advanced DP variants for bounded cases.
🔹 4. Branch and Bound
Definition: Systematically explores decision tree while pruning suboptimal solutions based on
bounds.
Characteristics:
Used for optimization problems.
Often used when greedy or DP fail.
Examples:
TSP: Lower-bound cost estimation to prune paths.
Knapsack: Prune branches where even the upper bound is worse than best solution so far.
🔹 5. Backtracking
Definition: Builds solution incrementally and abandons a path if it violates constraints.
Characteristics:
Uses recursion.
Explores all solutions with pruning.
Examples:
TSP: Try all routes, backtrack on exceeding distance.
Knapsack: Try all combinations, skip if capacity exceeded.
Bin Packing: Backtrack when no bin has space left.
🔹 Heuristics
Definition: Rule-of-thumb techniques to find good-enough solutions efficiently.
Characteristics:
Not guaranteed to be optimal.
Fast and scalable.
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 2/3
Application Domains:
TSP: Genetic algorithms, Simulated Annealing.
Bin Packing: First-Fit Decreasing (FFD).
Knapsack: Greedy approximation.
When to Use:
NP-Hard problems.
Real-time or large-scale problems.
Would you like a summarized table comparing all these strategies and their performance on Knapsack,
TSP, and Bin Packing?
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 3/3