Constraint programming based Lagrangian relaxation for the automatic recording problem. (English) Zbl 1026.90510

Sellmann, Meinolf; Fahle, Torsten

Ann. Oper. Res. 118, 17-33 (2003).

Summary: Whereas CP methods are strong with respect to the detection of local infeasibilities, OR approaches have powerful optimization abilities that ground on tight global bounds on the objective. An integration of propagation ideas from CP and Lagrangian relaxation techniques from OR combines the merits of both approaches. We introduce a general way of how linear optimization constraints can strengthen their propagation abilities via Lagrangian relaxation. The method is evaluated on a set of benchmark problems stemming from a multimedia application. The experiments show the superiority of the combined method compared with a pure OR approach and an algorithm based on two independent optimization constraints.

MSC:

90C06	Large-scale problems in mathematical programming
90C90	Applications of mathematical programming

Keywords:

optimization constraint; maximum weighted stable set constraint; knapsack constraint; Lagrangian relaxation