Report Assignment

Person Topic
Due
1
BERNAL; MARTHA LILIANA minimum spanning tree - history
7/25
2
BHASKARAN NAIR; SREEKUMAR shortest path - history
7/16
3
DARE; JESSE ANDREW George Dantzig - Verbal report on 7/8
7/9
4
DHARMAVARAM BHOGENDRA; A. nonlinear - convex cost flows
7/16
5
DIMOVA; BORYANA SLAVCHEVA minimum cost flow - history
7/30
6
GOEL; ANKUR James B. Orlin
7/30
7
GOMEZ CORREDERA; PABLO L. covering and matching problems
7/23
8
HAYES; SHAUN PAUL nonlinear - concave cost flows
7/25
9
KANEGAONKAR; SAMEER ASHOK project management - relation to network flows
7/25
10
KURIAKOSE; VINU physical flows as min-cost flows - history
7/23
11
LESMANA; HILLMAN maximum flow - push algorithms
7/25
12
LIU; XUEJIAO auction algorithms for network flows
7/18
13
MADDUKURI; CHANDRAKIRAN K D. R. Fulkerson
7/16
14
MAHFOUD; ROBERT HANNA minimum cost flow - cycle-canceling algorithms
7/30
15
NADAL; JAVIER FERNANDO Kantorovich, Hitchcock and Koopmans
7/30
16
NAGORI; BINIT VYOMESH stochastic network problems
7/9
17
NATARAJAN MOHAN; DINESH Jack Edmonds
7/9
18
NOLEN; JAMES HILTON transportation problem - history
7/18
19
PADMANABAN; VIVEK BALAJI networks/traffic assignment
7/23
20
PLAHA; SHAMSHER SINGH T. C. Hu
7/25
21
RAMANATHAN; SATYA traveling salesman problem - history
7/23
22
RIPPERT; THOMAS ASHTON applications of the minimal spanning tree
7/18
23
SBAYTI; HAYSSAM A. HICHAM generalized minimum cost flow - history
7/25
24
SHARMA; ABHINAV networks/vehicle routing
7/30
25
SINGH; NAYANDEEP L. R. Ford
7/9
26
SINGHAL; SAKSHI assignment problem - history
7/16
27
SOLIS; HECTOR minimum cost flow - out of kilter algorithm
7/9
28
SUJANTO,ADI minimum cost flow - successive shortest path
7/18
29
SUN; YU maximum flow - history
7/18
30
TANUKU; VENKATESH multicommodity flows
7/30

Return to Class Home page