Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
We deal with the linear programming relaxation of set partitioning problems arising in airline crew scheduling. Some of these linear programs have been extremely difficult to solve with the traditional algorithms. We have used an extension of the subgradient algorithm, the volume algorithm, to produce primal solutions that might violate the constraints by at most 2%, and that are within 1% of the lower bound. This method is fast, requires minimal storage, and can be parallelized in a straightforward way. © 2002 Elsevier Science B.V.
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University