Fundamentals of graph theory, partition, floor planning, placement, and routing. Programming techniques and algorithms; shortest/longest path, all-pairs shortest path, dynamic programming, linear programming, non-linear programming, evolutionary approaches, simulated annealing, and hyper-algorithms.