56:272 Integer Programming & Network Flows
Fall Semester 1997

HW #	Due Date	HW Topic
#1	17 Sept.	Graph & Network Concepts
#2	24 Sept.	Branch & Bound (knapsack problem) Minimum Spanning Trees Internet resources
#3	1 Oct.	DP for knapsack problem Shortest Path
#4	8 Oct.	Applications of Shortest Path Method Transportation model
#5	15 Oct.	Transportation problem Assignment problem Critical path method Resources on the WWW
#6	22 Oct.	Network Simplex Method Network Models
#7	29 Oct.	Chinese postman problem
#8	12 Nov.	Traveling salesman problem
#9
#10

Table of Contents

Exercise #	Due Date	Topic
#0		Use of APL68000 on Mac, Graph & Network Concepts
#1	20 October	Minimum Spanning Trees
#2	20 October	Ranking of Objects, given pairwise comparisons
#3	20 October	Branch & Bound Algorithm for Knapsack Problem
#4	27 October	Dynamic Programming Algorithm for Knapsack Problem
		Trim (Cutting-Stock) Problem
#6	3 November	Classical Transportation Problem
		Classical Assignment Problem
		Maximum Flow
#9	10 December	Location in the Plane (Weber's problem)
		Location in Network: Median Problem
#11	10 December	Location in Network: Center Problem
		Quadratic Assignment Problem
#13	10 December	Chinese Postman Problem
#14	17 November	Symmetric Traveling Salesman
#18	10 December	Assembly Line Balancing
#20		Capacitated Plant Location via Benders' Method
#21	10 December	Fractional Cutting-Plane Algorithm

Go back to IP&NF home page.