1 paper
Pierre Montalbano, Simon de Givry, George Katsirelos
In Constraint Programming, solving discrete minimization problems with hard and soft constraints can be done either using (i) soft global constraints, (ii) a reformulation into a l…