OR435

Course title: computational methods in OR
 

List of Topics (OPER 435) 

Lectures 

Traditional Optimization Algorithms 

The Golden Section Search, Newton’s Method, Modified method of Newton, The Gradient Methods, Barrier Methods, Hooke-Jeeves method.  

Data structure 

Algorithm Analysis 

Primitive operations and Big O notation

Sorting algorithms (Bubble sort and merge sort) 

Searching algorithms (Sequential Search, Binary Search) 

Trees - Tree Traversal, Pre order, In order, Post order Traversal 

Uninformed search 

• Breadth first
• Depth first
• Depth limited
• Iterative deepening
• Uniform Cost 

Informed Search  

• Best-first search
• Greedy best-first search
• A* search 

Heuristics 

• Beam Search
• Simulated annealing algorithm
• Game Search
• Tabu search 

Metaheuristics 

• Genetic algorithm 

Practical (Solver + LINGO)

Linear Programming 

Integer Programming 

Binary Programming 

Mixed Integer Programming 

Nonlinear Programming 

Transportation and Transshipment Problems

Assignment Problems 

Knapsack Problem 

Traveling Salesman Problem

Shortest Path Problem

Maximum Flow problem

Minimum cost flow problem 

Capacitated Facility Location Problem 

Scheduling Problem