Math 777

Combinatorial Optimization

 

 

                                                 ab - ba = a beautiful mind

 

 

 

WVU Home

Department of Mathematics

Career Links

Undergraduate Catalog Information (pdf)

Graduate Program Infomation

Back to Hong-Jian Lai's Home page

 

 

OFFICE: Armstrong Hall, 308K

 

OFFICE HOURS: Mondays and Fridays, 12:30 AM-2:00PM, or     

                             by appointments

 

TEXTBOOK:Combinatorial Optimization, by W. J. Cook, W. H. Cunningham, W. R. Pulleyblank and A. Schrijver,  John Wiley and Sons, Inc., New York, 1998.

 

PREREQUISTE:  Calculus (Math 251), and Linear Algebra or Algebra (Math 341, 343, 541, or 543), or consent of the instructor.

 

COURSE DESCRIPTION: the following topics will be covered:  Basic Concepts in Network Theory, Optimal Trees and Paths, Max-Flow and Min-Cut, Minimum Cost Flows, Optimal Matchings, and Combinatorial Optimizations in Matroids.

 

REQUIREMENTS: As this is a Ph.D. level graduate course, students are required to present related materials.

 

HOMEWORK and EXAMS:  There will be biweekly homework assignments (including in class weekly presentations), and a comprehensive final exam. The homework average will contribute 40% of the student’s grade; the in class presentations will contribute another 40% and the final will be worth 20% of the student’s grade.

 

Grading:

Score

Grade

90% and up

A

80-89%

B

70-79%

C

60-69%

D

59% and down

F

 

 

 

 

 

 

Page Last Modified: 08.22.03