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

DOI10.1287/opre.2016.1496zbMath1348.90393OpenAlexW2408351877MaRDI QIDQ2830761

Houyuan Jiang, Giovanna Miglionico, Giovanni Giallombardo

Publication date: 31 October 2016

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5147083b6e6dd1030e86a3f6e6edd27ca5c304f2

zbMATH Keywords

integer programmingconflict resolution problemtelevision advertising

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (1)

A combinatorial multi-armed bandit approach to correlation clustering

Cites Work

• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
• The capacitated max \(k\)-cut problem
• A hybrid genetic/optimization algorithm for a task allocation problem
• Semidefinite programming relaxations for the graph partitioning problem
• SPOT: Scheduling Programs Optimally for Television
• Conflict Resolution in the Scheduling of Television Commercials
• Exact Solutions to Task Allocation Problems
• Scheduling advertising slots for television
• Scheduling Commercials on Broadcast Television
• An efficient algorithm for a task allocation problem
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
• Scheduling Commercial Videotapes in Broadcast Television

This page was built for publication: New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials