This preview shows pages 1–2. Sign up to view the full content.
AMS 546 / MBA 546 Network Flows
Fall 2010
Estie Arkin
Instructor:
Estie Arkin, Math Tower 1106, 6328363, [email protected]
Course web page:
http://www.ams.sunysb.edu/˜estie/courses/546/ams546.html
Ofce hours:
TBA. You may also stop by whenever you have a question, I am usually in 104 every day. I also
welcome questions by email or by phone.
Grader:
Lectures:
Tuesday and Thursday, 9:5011:10 in ESS 181.
Prerequisites:
Ideally, students should have had a course (grad or undergrad) in linear programming. If you haven’t
had such a course, please let me know. (There are many texts on the subject, or check out the appendix in [AMO].)
Recommended Texts:
Network Flows: Theory Algorithms, and Applications
, by Ahuja, Magnanti, and Orlin. Also:
D. West
Introduction to Graph Theory
.
Other Recommended Texts:
•
Lawler,
Combinatorial Optimization: Networks and Matroids
•
Kleinberg and Tardos,
Algorithm Design
•
Cormen, Leiserson, Rivest and Stein
Introduction to Algorithms
•
Papadimitriou and Steiglitz,
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 01/31/2011 for the course AMS 546 taught by Professor Arkin,e during the Fall '08 term at SUNY Stony Brook.
 Fall '08
 Arkin,E

Click to edit the document details