Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
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.
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics