Approximated consistency for the automatic recording constraint

DOI10.1016/j.cor.2008.08.009zbMath1179.90152MaRDI QIDQ1010285

Meinolf Sellmann

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.009

zbMATH Keywords

approximation algorithms; global constraints; cost-based filtering; optimization constraints; relaxed consistency

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

Related Items

Approximated consistency for the automatic recording constraint

Cites Work

• Approximated consistency for the automatic recording constraint
• Consistency in networks of relations
• Cost based filtering for the constrained knapsack problem
• Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
• Constraint programming based Lagrangian relaxation for the automatic recording problem
• A Sufficient Condition for Backtrack-Free Search
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item