George Markowsky
J. Math. Anal. Appl.
In power generation and other production settings, technological constraints force restrictions on the number of time periods that a machine must stay up once activated, and stay down once deactivated. We characterize the polyhedral structure of a model representing these restrictions. We also describe a cutting-plane method for solving integer programs involving such min-up and min-down times for machines. Finally, we demonstrate how the polytope of our study generalizes the well-known cross polytope (i.e., generalized octahedron). © 2004 Elsevier B.V. All rights reserved.
George Markowsky
J. Math. Anal. Appl.
Andrew Skumanich
SPIE Optics Quebec 1993
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002
Minghong Fang, Zifan Zhang, et al.
CCS 2024