Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction combinatorial optimization problems. In CP, problems are modeled with constraints that describe acceptable solutions solved backtracking tree search augmented logical inference. this paper, we show how quantum algorithms can accelerate at both the levels of inference search. Leveraging existing algorithms,...

In this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. We also consider flexibility on distance standard for covering demand nodes by the servers. We use the satisfaction degree to represent the constraint of service capacity. The proposed model belongs to the class of mixed integer programming models. Our model can be redu...

In the present economic context, the operating theater is considered as a critical activity in health care management. This paper describes a model for operating room (OR) planning under constraint of a unique equipment. At first level we schedule elective surgeries under the uncertainty of using a unique equipment. At the second level we consider emergency surgeries, and at the third le...