We consider the conflict-resolution problem arising in the allocation of commercial advertisements to television program breaks. Given a set of commercials and a set of program breaks, the problem is to assign each commercial to (at most) one break, so that a total measure of the conflicts among commercials assigned to the same break is minimized. In fact, the conflict-resolution problem arises from several competition-avoidance requirements typically issued by advertisers. We introduce new integer programming formulations of the problem, and we report on computational results for several small- to large-sized instances, in order to evaluate performance of the proposed models.

Models For The Conflict Resolution Problem In The Scheduling Of TV Commercials

GIALLOMBARDO, Giovanni;Miglionico G.
2012

Abstract

We consider the conflict-resolution problem arising in the allocation of commercial advertisements to television program breaks. Given a set of commercials and a set of program breaks, the problem is to assign each commercial to (at most) one break, so that a total measure of the conflicts among commercials assigned to the same break is minimized. In fact, the conflict-resolution problem arises from several competition-avoidance requirements typically issued by advertisers. We introduce new integer programming formulations of the problem, and we report on computational results for several small- to large-sized instances, in order to evaluate performance of the proposed models.
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/177849
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact