Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.
Covers the general logistics, course rationale, prerequisites, organization, credits, workload, grading, and course content, including swarm intelligence, foraging strategies, and collective phenomena.