Network Flows

**Lectures:** TR 9:30-

**Text: D. Bertsekas, Network
Optimization--Continuous and Discrete Models **

Lecturer: Robert Meyer

4387 Computer Sciences (262)-7870

E-mail:rrm@cs.wisc.edu

Office Hours: M W R 2-3pm or by appointment

**Class photos from Spring ‘06 :
photo 1 photo 2 photo 3 **

**Homework 1
Homework 2
Homework 3**

**Homework 1
Homework 2
Homework 3
Homework 4
Homework 5
A GAMS model for use in hw5
Course Grades**

**INFORMS Bibiliographic database of 34,000 entries (searchable by
topic) **

**Papers for presentations for 2005 **

**A
shortest path approach to grid-graph partition
An application
of nonlinear assignment to brachytherapy
An application of assignment to data caching
Another paper on the data caching application
A shorter update
of the preceding paper
A GAMS model for the application in this paper
A relaxation
method for separable nonlinear network optimization
Intensity
matching (see paper on "Minimizing beam-on time...") **

**NEOS Optimization Codes****NEOS Network Simplex Code Link****NEOS Network Relaxation Method Code Link****NEOS Optimization Guide (Linear Programming)****NEOS Optimization Guide (Network Programming)****A network example in GAMS A network example with comments.****A GAMS Tutorial (by Rick Rosenthal) Focus on network example.****GAMS Notes (by Ron Rardin) Lengthier introduction to GAMS.****GAMS - A User's Guide Complete, lengthy guide in pdf format.****CPLEX User's Guide**

rrm@cs.wisc.edu