Search the dblp DataBase
Laurent Péridy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Philippe Baptiste, Claude Le Pape, Laurent Péridy
Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints. [Citation Graph (0, 0)][DBLP]
CP, 1998, pp:87-101 [Conf] - Patrice Boizumault, Yan Delon, Laurent Péridy
A CLP Approach for Examination Planning. [Citation Graph (0, 0)][DBLP]
Constraint Processing, Selected Papers, 1995, pp:85-101 [Conf] - Patrice Boizumault, Yan Delon, Laurent Péridy
Solving a real life exams problem using CHIP. [Citation Graph (0, 0)][DBLP]
ILPS, 1993, pp:661- [Conf] - Patrice Boizumault, Yan Delon, Laurent Péridy
Constraint Logic Programming for Examination Timetabling. [Citation Graph (0, 0)][DBLP]
J. Log. Program., 1996, v:26, n:2, pp:217-233 [Journal] - Laurent Péridy, David Rivreau
Local adjustments: A general algorithm. [Citation Graph (0, 0)][DBLP]
European Journal of Operational Research, 2005, v:164, n:1, pp:24-38 [Journal] - Philippe Baptiste, Laurent Péridy, Eric Pinson
A branch and bound to minimize the number of late jobs on a single machine with release time constraints. [Citation Graph (0, 0)][DBLP]
European Journal of Operational Research, 2003, v:144, n:1, pp:1-11 [Journal] - Laurent Péridy, Eric Pinson, David Rivreau
Using short-term memory to minimize the weighted number of late jobs on a single machine. [Citation Graph (0, 0)][DBLP]
European Journal of Operational Research, 2003, v:148, n:3, pp:591-603 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002