John S. Lew
Mathematical Biosciences
Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is fixed. It is demonstrated that in some cases fixing the structure makes the problem easier, whereas in general the problem remains NP-complete.
John S. Lew
Mathematical Biosciences
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization