Monday, June 17
10:00 AM-12:00 PM
Room 300
CP1
Optimization: Linear and Mathematical Programming
Chair: To be determined
- 10:00 Hoffman's Circle Untangled
- Jon Lee, University of Kentucky
- 10:20 Artificial-free Initialization of Simplex Method
- Hossein Arsham, University of Baltimore
- 10:40 The MIN PCS Problem and Piecewise Linear Model Estimation
- Edoardo Amaldi, Cornell University; and Marco Mattavelli, Swiss Federal Institute of Technology, Switzerland
- 11:00 The Feasible Solution Space for Steiner Trees
- Peter M. Joyce and F.D. Lewis, University of Kentucky; and N. Van Cleave, Texas Tech University
- 11:20 Independence and Clique Covering Numbers of the Cartesian Product of Graphs
- Glenn Chappell, University of Illinois, Urbana
- 11:40 Adding Product Life Cycles to Experience Bounded Lotsizing Models for Capacity Planning
- Tehsin Kuan and Subhash C. Sarin, Virginia Polytechnic Institute and State University
MEM, 3/21/96