Discrete and network optimization
Optimization & linear programming · Standard syllabus
Integer programming and branch-and-bound (overview)
Objectives
- Integer programming and branch-and-bound (overview)
- Transportation and assignment problems
- Shortest path and minimum spanning tree problems
- Network simplex (introduction)
- Multi-objective optimization and Pareto efficiency (brief)
Study materials
- Practice testComing soon