IDEAS home Printed from
   My bibliography  Save this paper

New Reformulations for the Conflict Resolution Problem in the Scheduling of Television Commercials


  • Giovanni Giallombardo
  • Giovanna Miglionico

    (Dipartimento di Ingegneria Informatica, Modellistica, Elettronica e Sistemistica, Universita della Calabria)

  • Houyuan Jiang

    () (Cambridge Judge Business School, University of Cambridge)


We consider the conflict-resolution problem arising in the allocation of commercial advertisements to television program breaks. Due to the competition-avoidance requirements issued by advertisers, broadcasters aim to allocate any pairs of commercials promoting highly conflicting products to different breaks. Hence, the problem consists of assigning commercials to breaks, subject to time capacity constraints, with the aim of maximizing a total measure of the conflicts among commercials assigned to different breaks. Since the existing reformulation can hardly be solved via exact methods, we introduce three new and efficient (mixed-)integer programming reformulations of the problem. Our computational study is based on two sets of test problems, one from the literature and another that we generate. Numerical results show the excellent performance of the proposed reformulations in terms of solution quality and computation times, when compared against an existing reformulation and an effective heuristic approach. We also provide theoretical evidences to demonstrate why some of our new reformulations should outperform the existing reformulation.

Suggested Citation

  • Giovanni Giallombardo & Giovanna Miglionico & Houyuan Jiang, 2015. "New Reformulations for the Conflict Resolution Problem in the Scheduling of Television Commercials," Working Papers 2015/03, Cambridge Judge Business School, University of Cambridge.
  • Handle: RePEc:jbs:wpaper:201503

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Victor F. Araman & Ioana Popescu, 2010. "Media Revenue Management with Audience Uncertainty: Balancing Upfront and Spot Market Sales," Manufacturing & Service Operations Management, INFORMS, vol. 12(2), pages 190-212, December.
    2. Andreas Ernst & Houyuan Jiang & Mohan Krishnamoorthy, 2006. "Exact Solutions to Task Allocation Problems," Management Science, INFORMS, vol. 52(10), pages 1634-1646, October.
    Full references (including those not matched with items on IDEAS)

    More about this item


    television advertising; conflict resolution problem; integer programming;

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbs:wpaper:201503. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ruth Newman). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.