Fernando Martinez, Juntao Chen, et al.
AAAI 2025
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.
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
Chai Wah Wu
Linear Algebra and Its Applications
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000