The TV-break packing problem
type: Item
instance of: scholarly article
title: The TV-break packing problem
zbMATH Open document ID: 1102.90370
author: Thierry Benoist
author: Eric Bourreau
author: Benoît Rottembourg
published in: European Journal of Operational Research
publication date: 2006-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5073125
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: constraint programming
zbMATH Keywords: linear programming
zbMATH Keywords: local search
MaRDI profile type: Publication
full work available at URL: j.ejor.2005.09.027
OpenAlex ID: W2001772548
cites work: Q3056948
cites work: Principles and Practice of Constraint Programming – CP 2003
cites work: Q4475632
cites work: Heuristics for large constrained vehicle routing problems
cites work: Cost based filtering for the constrained knapsack problem
cites work: Local Search and Constraint Programming
cites work: Q4198056
cites work: Q4178782
cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: Networks of constraints: Fundamental properties and applications to picture processing
cites work: Fiber-to-object assignment heuristics
DOI: 10.1016/J.EJOR.2005.09.027
description: scientific article; zbMATH DE number 5073125