This paper presents an efficient algorithm for an integrated operating room planning and
scheduling problem. It combines the assignment of surgeries to operating rooms and …

Register allocation (map** variables to processor registers or memory) and instruction
scheduling (reordering instructions to increase instruction-level parallelism) are essential …

Dominance breaking is a powerful technique in improving the solving efficiency of
Constraint Optimization Problems (COPs) by removing provably suboptimal solutions with …

Many constraint problems exhibit dominance relations which can be exploited for dramatic
reductions in search space. Dominance relations are a generalization of symmetry and …

The exploitation of dominance relations in constraint optimization problems can lead to
dramatic reductions in search space. We propose an automatic method to detect some of the …

Soft neighborhood substitutability (SNS) is a powerful technique to automatically detect and
prune dominated solutions in combinatorial optimization. Recently, it has been shown in [26] …

Dual presolving reductions are a class of reformulation techniques that remove feasible or
even optimal solutions while guaranteeing that at least one optimal solution remains, as …

Exploiting dominance relations in many Constraint Optimization Problems can drastically
speed up the solving process in practice. Identification and utilization of dominance …

Dominance breaking is shown to be an effective technique to improve the solving speed of
Constraint Optimization Problems (COPs). The paper proposes separate techniques to …

Solving constraint satisfaction problems often involves a large amount of redundant
exploration stemming from the existence of subproblems whose information can be reused …