Wednesday, May 22
1:50 PM-3:20 PM
Oak Bay 1
CP56
Integer Programming
- Dual Bregman Proximal Methods for Large-Scale 0--1 Problems
- K.C. Kiwiel, System Research Institute, Poland; P.O. Lindberg, Linkoping University, Sweden; and Andreas Nou, Royal Institute of Technology, Sweden
- m-Machine Job Shop Scheduling with Labour Constraints
- Rene van Dal, Universitat Heidelberg, Germany
- Parallel Preprocessing and Branch and Cut
- Hartmut Schwab, Universitat Heidelberg, Germany
- Efficient Implementation of Parallel Branch and Cut
- Dieter Homeister, Universitat Heidelberg, Germany
JCG, 3/4/96