ORI 391Q Network Flow Programming

Unique: 78115, Summer, 2002

Place and time:

T Th 1:00 - 3:30 p.m. in ETC 5.132

Professor:

Office:

Office Hours:

Paul A. Jensen

ETC 5.128, 471 - 6495, pjensen@mail.utexas.edu

T Th 9:30 a.m. - 12 noon or by appointment

TA:

Office:

Office Hours:

Xinhui Zhang

xinhui.zhang@mail.utexas.edu

ETC 5.112, Friday, 1 - 2 p.m.

Required Texts

Network Flow Programming by Paul A. Jensen, Printed by the University Coop Custom Publishing, Summer 2002
  Lecture Notes for ME 391Q, Spring 2002 by Paul A. Jensen, Printed by the University Coop Custom Publishing, Summer 2002

Class www page:

www.me.utexas.edu/~jensen/network_02

Syllabus:

Situations arising from the fields of transportation, water resources, manufacturing and many others give rise to network flow models. A flow network is a collection of nodes and arcs. Each arc passes from one node to another and carries a commodity called flow. A requirement is that flow be conserved at each node. The optimization problem is to find the flow in each arc that minimizes the total cost of the flow in the network. This course has three aspects: modeling real problems as networks, the theory associated with network optimization, and algorithms implementing the theory. The course covers the broad range of network flow problems, but stresses the pure and generalized, single commodity, minimum cost network flow problem.