New filtering algorithms for combinations of among constraints

DOI10.1007/s10601-008-9067-7zbMath1186.68552MaRDI QIDQ842795

Ashish Sabharwal, Willem-Jan van Hoeve, Louis-Martin Rousseau, Gilles Pesant

Publication date: 25 September 2009

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-008-9067-7

zbMATH Keywords

car sequencing; domain consistency; polynomial time filtering; regular constraint; sequence constraint

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Constraint programming and operations research, Weight-based heuristics for constraint satisfaction and combinatorial optimization problems, An optimal arc consistency algorithm for a particular case of sequence constraint

Uses Software

• CSPLib

Cites Work

• Unnamed Item
• A \texttt{cost-regular} based hybrid column generation approach
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Introducing global constraints in CHIP
• A dynamic programming approach for consistency and propagation for knapsack constraints
• Revisiting the Sequence Constraint
• Principles of Constraint Programming
• Combination of Among and Cardinality Constraints
• Principles and Practice of Constraint Programming – CP 2004