Sequencing and Counting with the multicost-regular Constraint
From MaRDI portal
Publication:3630160
DOI10.1007/978-3-642-01929-6_14zbMath1241.68104MaRDI QIDQ3630160
Sophie Demassey, Julien Menana
Publication date: 3 June 2009
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01929-6_14
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Invariants for time-series constraints, New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach, Constraint programming and operations research, When bounds consistency implies domain consistency for regular counting constraints, On matrices, automata, and double counting in constraint programming, An optimal arc consistency algorithm for a particular case of sequence constraint, Formal languages for integer programming modeling of shift scheduling problems