The University of Iowa
Integer Programming
& Network Flows
Fall Semester 2003
|
The University of Iowa |
56:272 Integer Programming & Network Flows Fall Semester 2003 |
|---|
| HW # | Due Date | HW Topic |
|---|---|---|
| #1 | 3 September |
WWW Resources, Integer programming models |
| #2 | 10 September |
Integer programming models |
| #3 | 17 September |
Graphs; ILP model |
|
|
|
Branch&Bound for zero-one knapsack problems; ILP model of staffing problem |
|
|
Shortest path; Integer programming models | |
|
|
Integer LP models, network | |
|
|
Chinese postman, network simplex algorithm | |
|
|
Traveling salesman problem | |
|
|
Traveling salesman problem | |
|
|
p-Median Location Problem |
| Exercise # | Due Date | Topic |
|---|---|---|
| #0 |
Graph & Network Concepts |
|
| #1 |
Minimum Spanning Trees |
|
| #2 | Monday, 22 Sept. |
Ranking of Objects, given pairwise comparisons |
| #3 | Monday, 29 Sept. |
Branch & Bound Algorithm for Knapsack Problem |
| #4 |
Dynamic Programming Algorithm for Knapsack Problem |
|
| #5 |
Trim (Cutting-Stock) Problem |
|
| #6 |
Classical Transportation Problem |
|
| #7 |
Classical Assignment Problem |
|
| #8 |
Maximum Flow |
|
| #9 |
Location in the Plane (Weber's problem) |
|
| #10 |
Location in Network: Median Problem |
|
| #11 |
Location in Network: Center Problem |
|
| #12 |
Quadratic Assignment Problem |
|
| #13 |
Chinese Postman Problem |
|
| #14 |
Symmetric Traveling Salesman Problem |
|
|
|
||
|
|
||
|
|
Generalized Assignment Problem | |
| #18 |
Assembly Line Balancing |
|
| #20 |
Capacitated Plant Location via Benders' Method |
|
| #21 |
Fractional Cutting-Plane Algorithm |
|
|
|
Flowshop Scheduling |
to IP&NF home page.
Last modified: 17 September 2003