Raymond Wu, Jie Lu
ITA Conference 2007
Recent developments in the use of greedy algorithms in linear programming are reviewed and extended. We find a common generalization of some theorems of Queyranne-Spieksma-Tardella, Faigle-Kern, and Fujishige about greedy algorithms for linear programs in diverse contexts. Additionally, we extend a well-known theorem of Topkis about submodular functions on the product of chains to submodular functions on the product of lattices.
Raymond Wu, Jie Lu
ITA Conference 2007
Leo Liberti, James Ostrowski
Journal of Global Optimization
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010