Tuesday Afternoon, January 30, 1996
Grand Ballroom North
Session 15
Chair: Eva Tardos, Cornell University
- 1:30-1:50 A Polynomial Time Primal Network Simplex Algorithm
- James B. Orlin, Massachusetts Institute of Technology
- 1:55-2:15 A Capacity Scaling Algorithm for Convex Cost Submodular Flows
- Satoru Iwata, Kyoto University, Japan
- 2:20-2:40 A Polynomial Algorithm for Abstract Maximum Flow
- S. Thomas McCormick, University of British Columbia, Canada
11/13/95