56:272 Integer Programming
&Network Flows

Fall Semester 2003

 

Date

Lecture topic

Hypercard stacks

 Reading
(Wolsey)

Reading
(Boffey)

 1
  25 Aug Integer programming models:
set covering, location, etc.		 ILP_Models_Intro
Set_Covering_1, _2

Chap. 1

--

 2
  3 Sept. Lagrangian relaxation Lagrangian_Duality

§2.4.5,
Chap 10

 --

 3
  8 Sept Introduction to graphs & networks Graphs & Networks Intro

 --

Chap 1

 4
  15 Sept Spanning trees,  Trees

§3.5, Chap. 4

2.1-3

 5
  22 Sept Shortest paths, Max flows,
Min-cost network flow		 Shortest_Path
MaxFlow
Min_Cost_Network_Flow

§3.1-3
 §10.2-3

 6
  29 Sept Search trees, Dynamic Pgmg. Search_Trees
Decision_Analysis

Chap. 5
  §2.4, 3.1-2

 7
  6 Oct Routing: Postman problem Postman

--
  §7.3

 8
  13 Oct Routing: Traveling salesman. TSP_models
TSP_B&B
TSP_Heuristics

--

§7.1-2,
§8.1-3

 9
  20 Oct  Location problems Location_Problems

--

§5.1-3

 10
  27 Oct  Computational complexity Complexity

Chap. 6
 Appendix

 11
  3 Nov. Cutting plane methods Cutting_Planes

 Chap. 8

--

 12
  10 Nov  Implicit enumeration Balas_Algorithm

Chap. 7

--

 13
  17 Nov Benders' partitioning
Line balancing		 Benders_Decomposition
CPL_via_Benders
ALB_Intro

--

--

 14
  1 Dec Scheduling Flowshop

 15
  8 Dec Review

 16
    FINAL EXAMINATION

to IP&NF home page.

http://asrl.ecn.uiowa.edu/dbricker/ipnf_syllabus.html

dennis-bricker@uiowa.edu

Last modified: 23 August 2003