Sequencing and Counting with the multicost-regular Constraint

DOI10.1007/978-3-642-01929-6_14zbMath1241.68104OpenAlexW1551241552MaRDI 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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Constraint programming and operations research ⋮ Invariants for time-series constraints ⋮ New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach ⋮ Formal languages for integer programming modeling of shift scheduling problems ⋮ 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

This page was built for publication: Sequencing and Counting with the multicost-regular Constraint