Approximated consistency for the automatic recording constraint
From MaRDI portal
Publication:1010285
DOI10.1016/j.cor.2008.08.009zbMath1179.90152OpenAlexW2000283457MaRDI QIDQ1010285
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
approximation algorithmsglobal constraintscost-based filteringoptimization constraintsrelaxed consistency
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
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
This page was built for publication: Approximated consistency for the automatic recording constraint
