Thursday, June 20
1:30-3:30 PM
Room 304
CP17
Optimization: Networks, Scheduling, and Matching
Chair: Leslie Hall, Johns Hopkins University
- 1:30 Distributed Scheduling in Networks with Unit Capacity Edges
- Perry Fizzano, University of Puget Sound; Clifford Stein, Dartmouth College
- 1:50 A Combinatorial Approach for Optimal Scheduling
- Hakan Lennerstad and Lars Lundberg, University of Karlskrona, Sweden
- 2:10 Two-Path Subsets: Efficient Counting and Applications to Performability Analysis
- Michael O. Ball, University of Maryland, College Park; Jane Hagstrom, University of Illinois; and J. Scott Provan, University of North Carolina, Chapel Hill
- 2:30 A Generalization of Optimal Matching
- William H. Cunningham and James F. Geelen, University of Waterloo, Canada
- 2:50 On the Boolean-Quadric Packing Uncapacitated Facility-Location Polytope
- Jon Lee and Jill Hardin, University of Kentucky; and Janny Leung, University of Arizona
- 3:10 Matching, Majorization, and Thresholds
- Gregory L. McColm, University of South Florida
MEM, 4/10/96