The TV-break packing problem
From MaRDI portal
Publication:853012
DOI10.1016/J.EJOR.2005.09.027zbMATH Open1102.90370OpenAlexW2001772548MaRDI QIDQ853012FDOQ853012
Authors: Thierry Benoist, Eric Bourreau, Benoît Rottembourg 
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.027
Recommendations
- Conflict resolution in the scheduling of television commercials
- Scheduling Commercial Videotapes in Broadcast Television
- The complexity of scheduling TV commercials
- New formulations for the conflict resolution problem in the scheduling of television commercials
- Scheduling Commercials on Broadcast Television
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Networks of constraints: Fundamental properties and applications to picture processing
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Principles and Practice of Constraint Programming – CP 2003
- Local Search and Constraint Programming
- Cost based filtering for the constrained knapsack problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Heuristics for large constrained vehicle routing problems
- Fiber-to-object assignment heuristics
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: The TV-break packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853012)
