A global constraint for total weighted completion time for cumulative resources
Engineering Applications of Artificial Intelligence
Modeling the Regular Constraint with Integer Programming
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Sequencing and Counting with the multicost-regular Constraint
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
SLIDE: A Useful Special Case of the CARDPATH Constraint
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Efficient context-free grammar constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Decompositions of grammar constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Constraints
Decomposing global grammar constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Solving nurse rostering problems using soft global constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A large neighbourhood search approach to the multi-activity shift scheduling problem
Journal of Heuristics
The extended global cardinality constraint: An empirical survey
Artificial Intelligence
Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling
Management Science
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
A shortest path-based approach to the multileaf collimator sequencing problem
Discrete Applied Mathematics
Revisiting the sequence constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The increasing nvalue constraint
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Optimizing the unlimited shift generation problem
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
A generalized arc-consistency algorithm for a class of counting constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Explaining propagators for s-DNNF circuits
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
On an exact method for the constrained shortest path problem
Computers and Operations Research
Journal of Artificial Intelligence Research
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
The seqbin constraint revisited
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
FOCUS: a constraint for concentrating high costs
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A hybrid MIP/CP approach for multi-activity shift scheduling
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling
INFORMS Journal on Computing
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
Journal of Scheduling
Hi-index | 0.01 |
Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To solve hard combinatorial optimization problems using CP alone or hybrid CP-ILP decomposition methods, costs also have to be taken into account within the propagation process. Optimization constraints, with their cost-based filtering algorithms, aim to apply inference based on optimality rather than feasibility. This paper introduces a new optimization constraint, cost-regular. Its filtering algorithm is based on the computation of shortest and longest paths in a layered directed graph. The support information is also used to guide the search for solutions. We believe this constraint to be particularly useful in modeling and solving Column Generation subproblems and evaluate its behaviour on complex Employee Timetabling Problems through a flexible CP-based column generation approach. Computational results on generated benchmark sets and on a complex real-world instance are given.