Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
The continuous mixing set is S = {(s, r, z) ∈ ℜ × ℜ+n × Zn : s + rj + wj zj ≥ fj, j = 1, ..., n}, where w1, ..., wn > 0 and f1, ..., fn ∈ ℜ. Let m = | {w1, ..., wn} |. We show that when w1 | ⋯ | wn, optimization over S can be performed in time O (nm + 1), and in time O (n log n) when w1 = ⋯ = wn = 1. © 2008 Elsevier B.V. All rights reserved.
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998