Sequencing and Counting with the multicost-regular Constraint

Authors:
Julien Menana;Sophie Demassey
Affiliations:
École des Mines de Nantes, LINA CNRS UMR 6241, Nantes, France F-44307;École des Mines de Nantes, LINA CNRS UMR 6241, Nantes, France F-44307
Venue:
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2009

Citing 7
Cited 11

Minimization methods for non-differentiable functions

Minimization methods for non-differentiable functions
Reformulation of Global Constraints Based on Constraints Checkers

Constraints
On global warming: Flow-based soft global constraints

Journal of Heuristics
A Cost-Regular Based Hybrid Column Generation Approach

Constraints
Flow-Based Propagators for the SEQUENCE and Related Global Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Efficient context-free grammar constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Reformulating global constraints: the slide and regular constraints

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation

Formal languages for integer programming modeling of shift scheduling problems

Constraints
Markov constraints: steerable generation of Markov sequences

Constraints
Identifying patterns in sequences of variables

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Revisiting the tree Constraint

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
On matrices, automata, and double counting

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hybrid methods for the multileaf collimator sequencing problem

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An optimal arc consistency algorithm for a chain of atmost constraints with cardinality

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
On matrices, automata, and double counting in constraint programming

Constraints
Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling

INFORMS Journal on Computing
Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint

Journal of Heuristics
An optimal arc consistency algorithm for a particular case of sequence constraint

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems, where a schedule meets patterns and occurrence requirements which are intricately bound. The optimization problem underlying the multicost-regular constraint is NP-hard but it admits an efficient Lagrangian relaxation. Hence, we propose a filtering based on this relaxation. The expressiveness and the efficiency of this new constraint is experimented on personnel scheduling benchmark instances with standard work regulations. The comparative empirical results show how multicost-regular can significantly outperform a decomposed model with regular and global-cardinality constraints.