The conflict-resolution problem is to schedule advertisements into TV commercial breaks so that the total conflict weight between advertisements scheduled to the same commercial break is minimized. We present several integer linear programming reformulations. We propose valid cuts and a Benders decomposition approach for solving these reformulations. Encouraging computational results are reported.
Integer Linear Programming Reformulations for the TV Commercial Breaks Scheduling Problem
GIALLOMBARDO, Giovanni;Miglionico G.
2011-01-01
Abstract
The conflict-resolution problem is to schedule advertisements into TV commercial breaks so that the total conflict weight between advertisements scheduled to the same commercial break is minimized. We present several integer linear programming reformulations. We propose valid cuts and a Benders decomposition approach for solving these reformulations. Encouraging computational results are reported.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
