The TV-break packing problem

DOI10.1016/j.ejor.2005.09.027zbMath1102.90370OpenAlexW2001772548MaRDI QIDQ853012

Thierry Benoist, Benoît Rottembourg, Eric Bourreau

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

zbMATH Keywords

linear programmingcombinatorial optimizationlocal searchconstraint programming

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A Decision Support System for Planning Promotion Time Slots, The TV advertisements scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Networks of constraints: Fundamental properties and applications to picture processing
• Fiber-to-object assignment heuristics
• Cost based filtering for the constrained knapsack problem
• Heuristics for large constrained vehicle routing problems
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Local Search and Constraint Programming
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2003