Quantum Algorithm Design, Constraint Satisfaction, Quantum Computing, Computer Science.
takes continuous values, while other times, those values are discrete. Your optimization space can be either finite or infinite, and it can also vary in different ways. You have a set of constraints in CSPs, and you want them all to be met as best as possible. This sub-class of CSPs can be called a