Indicative Module Content
Business research models, complexity of algorithms, NP-hard problems. Linear programming: Simplex algorithm, Binary theory, the problem transportation. Integer programming: Branch and bound, the partition problem, the minimum set overlap problem, dynamic programming, the knapsack problem, generalized knapsack. Heuristic algorithms: Performance evaluation techniques, reachability ratio, the vertex covering problem, maximum independent subset, upper and lower bounds, empirical evaluation of heuristic methods. Local search methods: Neighborhood structure, neighborhood search methods, the traveling salesperson problem, graph partitioning. Simulated annealing: The Metropolis algorithm, applications, the maximum intersection problem.