Sequencing and Counting with the multicost-regular Constraint

DOI10.1007/978-3-642-01929-6_14MaRDI QIDQ3630160zbMATH OpenOpenAlexFDO

Authors Julien Menana, Sophie Demassey

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

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

Recommendations

• Modeling the Regular Constraint with Integer Programming
• A \texttt{cost-regular} based hybrid column generation approach
• A resource cost aware cumulative
• Revisiting the Sequence Constraint
• Identifying patterns in sequences of variables

Cited in

(9)

• 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
• Identifying patterns in sequences of variables
• Modeling the Regular Constraint with Integer Programming
• Invariants for time-series constraints
• New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630160)