( en | de | ru )

 

Disambiguation of "Péridy, Laurent"

Author of the publication

copydeleteadd this publication to your clipboard
Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints.

, , and . CP, volume 1520 of Lecture Notes in Computer Science, page 87-101. Springer, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Laurent Bartholdi

Laurent Ntahuga

Thomas Laurent

Thomas Laurent

Sarah Laurent

 

Other publications of authors with the same name

Elimination Rules for Job-Shop Scheduling Problem., , , and . Handbook of Scheduling, Chapman and Hall/CRC, (2004)Local adjustments: A general algorithm., and . Eur. J. Oper. Res., 164 (1): 24-38 (2005)Constraint Logic Programming for Examination Timetabling., , and . J. Log. Program., 26 (2): 217-233 (1996)A branch and bound to minimize the number of late jobs on a single machine with release time constraints., , and . Eur. J. Oper. Res., 144 (1): 1-11 (2003)Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints., , and . CP, volume 1520 of Lecture Notes in Computer Science, page 87-101. Springer, (1998)Using short-term memory to minimize the weighted number of late jobs on a single machine., , and . Eur. J. Oper. Res., 148 (3): 591-603 (2003)Cut generation for an employee timetabling problem., , , and . Eur. J. Oper. Res., 197 (3): 1178-1184 (2009)A CLP Approach for Examination Planning., , and . Constraint Processing, Selected Papers, volume 923 of Lecture Notes in Computer Science, page 85-101. Springer, (1995)A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor., , and . Ann. Oper. Res., 129 (1-4): 33-46 (2004)Solving a real life exams problem using CHIP., , and . ILPS, page 661. MIT Press, (1993)