Class, Topics, Assignments

1. 1/16: Overview
2. 1/18: IP Modeling
3. 1/23: IP Modeling
4. 1/25: LP review (pp. 1-30)
   Assignment 1, due 2/1: read text Ch. 1; written: text Ch 1. formulate problems 1,5, & 7, IPF1 #2, and IPX #1.
5. 1/30
6. 2/1 Assignment 2: IPX 2-10; due 2/13
7. 2/6
8. 2/8
9. 2/13
10. 2/15
11. 2/20 Assignment 3: IPX 11, 12; due 3/1
12. 2/22
13. 2/27 B&B penalties
14. 3/1 Pseudocosts
15. 3/6 Selection and separation rules.
16. 3/8 Complexity. Solutions to exercises distributed exam 1 discussed..
    3/13 Spring break, no class
    3/15 Spring break, no class
17. 3/20 Exam 1. part 1
18. 3/22 Exam 1, part 2.
19. 3/27 Complexity, Lagrangean relaxation (Excel spreadsheet)
20. 3/29 Lagrangean relaxation
21. 4/3 Heuristic methods
22. 4/5 Construction heuristics
23. 4/10 GRASP
24. 4/12 Tabu Search
25. 4/17 Genetic algorithms
26. 4/19 Pure networks, structure and algorithms
27. 4/24 Interval-flow networks
28. 4/26 LP and MIP computation (notes, PDF)
29. 5/1 (Last class) New directions in integer programming (PDF notes, 411K, with corrections from class discussion)
30. 5/8 Final exam

• “Text” refers to Wolsey book
• Page numbers refer to class notes
• IPF1 = “IP formulation problems I” in notes,
• IPX = “IP Exercises” in notes

Homework Solutions

• IPX solutions (PDF, Postscript)
• IPF1 solutions (PDF, Postscript)
• Woolsey solutions, incomplete (PDF, Postscript)