Operations Research Letters

Paper

01 Jan 1990

Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds

View publication

Abstract

The notion of coefficient reduction is extended for 0-1 knapsack-like constraints by taking advantage of the special structure of variable bounding constraints. Our procedure produces reductions not detected by myopic coefficient reduction methods. © 1990.

Related

Conference paper

Better on wafer performance and mask manufacturability of contacts with no or non-traditional serifs

Donald Samuels, Ian Stobert

SPIE Photomask Technology + EUV Lithography 2007

Conference paper

Total Source Mask Optimization: High-capacity, resist modeling, and production-ready mask solution

Moutaz Fakhry, Yuri Granik, et al.

SPIE Photomask Technology + EUV Lithography 2011

Paper

On the spectral radius of (0,1)-matrices

R.A. Brualdi, A.J. Hoffman

Linear Algebra and Its Applications

Conference paper

Performance data on new tunable attenuating PSM for 193nm and 157nm lithography

Hans Becker, Frank Schmidt, et al.

Photomask and Next-Generation Lithography Mask Technology 2004

View all publications