1 / 5

IE 535 Network Theory and Applications

IE 535 Network Theory and Applications. Fall 2010. Instructor Sungsoo Park (room 4112, sspark@kaist.ac.kr , tel:3121 ) Office hour: Tu, Thr, 14:30 – 16:30 or by appointment Classroom: E2 room 1124 Class hour: Tu, Thr 13:00 – 14:30 Homepage: http://solab.kaist.ac.kr TA:

melbak
Download Presentation

IE 535 Network Theory and Applications

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. IE 535 Network Theory and Applications Fall 2010

  2. Instructor • Sungsoo Park (room 4112, sspark@kaist.ac.kr, tel:3121) • Office hour: Tu, Thr, 14:30 – 16:30 or by appointment • Classroom: E2 room 1124 • Class hour: Tu, Thr 13:00 – 14:30 • Homepage: http://solab.kaist.ac.kr • TA: • Kyungmi Hwang (room 4114, emptycan82@hanmail.net, tel:3161) • Office hour: Tu, Thr, 14:30 – 16:30 or by appointment • Grading: Midterm 30-40%, Final 40-60%, HW 10-20% (including Programming HW)

  3. Contents • Theory and algorithms for network problems • Applications: Manufacturing, production/ transportation, logistics/ scheduling/ telecommunication/ power/ computer/ engineering, etc. • Topics: introduction, shortest path problem, maximum flow problem, minimum cost network flow problem, multicommodity problem, trees, matching, network design • Some programming assignments • Language in Korean (English if foreign students register), materials in English

  4. Materials • “Network Flows: Theory, Algorithms, and Applications”, by Ahuja, Magnanti, Orlin, 1993, Prentice-Hall. • “Flows in Networks”, Ford, Fulkerson, 1962, Princeton University Press. • “Combinatorial Optimization: Networks and Matroids”, Lawler, 1976, Holt, Rinehart and Winston • “Algorithms for Network Programming”, Kennington and Helgason, 1980, John Wiley & Sons. • “Combinatorial Optimization: Algorithms and Complexity”, Papadimitriou and Steiglitz, 1982, Prentice Hall. • “Graphs and Algorithms”, Gondran and Minoux, 1984, Wiley-Interscience • “Optimization Algorithms for Networks and Graphs” Evans and Minieka, 1992, Marcel Dekker • “”Combinatorial Optimization”, Cook, Cunningham, Pulleyblank, and Schrijver, 1998, John Wiley & Sons. • “Graph Theory with Applications”, Bondy and U.S.R. Murty, 1976, 2008 (Springer) • etc

  5. Prerequisites: Knowledge of LP (IE 531 Linear Programming or equivalent/ consent of instructor)

More Related