Theme: applications

ordonnancement/planification

• Filtering AtMostNValue with Difference Constraints: Application to the Shift Minimisation Personnel Task Scheduling Problem (2013).
  Jean-Guillaume Fages Tanguy Lapègue 19th International Conference on Principles and Practice of Constraint Programming (CP'13), best student paper, Lectures Notes in Computer Science 8124
• Three Generalizations of the FOCUS Constraint (2013).
  Nina Narodytska Thierry Petit Mohamed Siala Toby Walsh IJCAI, 23rd International Joint Conference on Artificial Intelligence,
• Three Generalizations of the FOCUS Constraint (extended version including proofs) (2013).
  Nina Narodytska Thierry Petit Mohamed Siala Toby Walsh CoRR abs/1304.5970
• A Scalable Sweep Algorithm for the cumulative and bin-packing Constraints (2012).
  Arnaud Letort Fourth International Workshop on Bin Packing and Placement Constraints (CPAIOR-BPPC'12), Nantes, France.
• cumulatives trajectories: a Constraint for Modelling Preemptive Reassignable Tasks with Momentarily Resource Consumption (2011). [paper]
  Arnaud Letort Doctoral Program of the 17th International Conference on Principles and Practice of Constraint Programming (CP'11), pp. 49--54.
• An Optimal Constraint Programming Approach to the Open-Shop Problem (2011).
  Arnaud Malapert Hadrien Cambazard Christelle Guéret Narendra Jussien André Langevin Louis-Martin Rousseau INFORMS Journal on Computing
• The Ordered Distribute Constraint (2011).
  Thierry Petit Jean-Charles Régin International Journal on Artificial Intelligence Tools (IJAIT)
• Bin-Repacking Scheduling in Virtualized Datacenters (2011).
  Fabien Hermenier Sophie Demassey Xavier Lorca 17th International Conference on Principles and Practice of Constraint Programming (CP'11), Perrugia, Italy. Lecture Notes in Computer Science
• A Collaborative Combination between Column Generation and Ant Colony Optimization for Solving Set Packing Problems (2011). [paper]
  Aurélien Merel Xavier Gandibleux Sophie Demassey 9th Metaheuristics International Conference (MIC'11), Udine, Italy.
• Algorithmes de filtrage pour des problèmes cumulatifs discrets avec dépassements de ressource (2011).
  Alexis De Clercq Thierry Petit Nicolas Beldiceanu Narendra Jussien 7èmes Journées Francophones de Programmation par Contraintes (JFPC'11),
• Assessing Railway Infrastructure Capacity by Solving the Saturation Problem with an Improved Column Generation Algorithm (2011).
  Aurélien Merel Xavier Gandibleux Sophie Demassey 4th International Seminar on Railway Operations Modelling and Analysis (RailRome'11), Rome, Italy.
• Towards a Realistic Evaluation of Railway Infrastructure Capacity (2011). [paper]
  Aurélien Merel Xavier Gandibleux Sophie Demassey 9th World Congress on Railway Research (WCRR'11), Lille, France.
• A Constraint Programming Approach for a Batch Processing Problem with Non-identical Job Sizes (2011). [paper]
  Arnaud Malapert Christelle Guéret Louis-Martin Rousseau Technical report 11-06-AUTO, École des Mines de Nantes.
• The Ordered Distribute Constraint (2010). [hal] [paper]
  Thierry Petit Jean-Charles Régin 22th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'10),
• New Filtering for the cumulative Constraint in the Context of Non-Overlapping Rectangles (2010). [doi]
  Nicolas Beldiceanu Mats Carlsson Sophie Demassey Emmanuel Poder Annals of Operations Research 184(1): 27-50.
• On Matrices, Automata and Double Counting (2010). [slides]
  Nicolas Beldiceanu Mats Carlsson Pierre Flener Justin Pearson 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'10), Bologna, Italy. Lecture Notes in Computer Science 6140: 10--24.
• Modelling a Maintenance Scheduling Problem with Alternative Resources (2010).
  Aliaa M. Badr Arnaud Malapert Kenneth N. Brown The 9th International Workshop on Constraint Modelling and Reformulation (ModRef'10) held at CP'10, St. Andrews, Scotland.
• A soft constraint for cumulative problems with over-loads of resource (2010).
  Alexis De Clercq Doctoral Program of the 16th International Conference on Principles and Practice of Constraint Programming (CP'10), pp. 49--54.
• Un algorithme de génération de colonnes pour le problème de capacité d'infrastructure ferroviaire (2010). [hal]
  Aurélien Merel Sophie Demassey Xavier Gandibleux 11ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'10), Toulouse, France.
• Modelling a Maintenance Scheduling Problem with Alternative Resources (2010). [paper]
  Aliaa M. Badr Arnaud Malapert Kenneth N. Brown Technical report 10-03-INFO, École des Mines de Nantes.
• Modélisation et optimisation des préférences en planification de personnel (2010). [paper]
  Julien Menana Sophie Demassey Narendra Jussien Technical report 11-01-INFO, École des Mines de Nantes.
• Closing the Open Shop: Contradicting Conventional Wisdom (2009). [doi] [url]
  Diarmuid Grimes Emmanuel Hebrard Arnaud Malapert 15th International Conference on Principles and Practice of Constraint Programming (CP'09), Lecture Notes in Computer Science 5732: 400-408.
• Sequencing and counting with the multicost-regular constraint (2009). [hal] [doi] [paper]
  Julien Menana Sophie Demassey 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), Pittsburgh, USA. Lecture Notes in Computer Science 5547: 178--192.
• Séquencer et compter avec la contrainte multicost-regular (2009). [hal] [paper]
  Julien Menana Sophie Demassey 5èmes Journées Francophones de Programmation par Contraintes (JFPC'09), Orléans, France. pp. 125--134.
• An improved Upper Bound for the Railway Infrastructure Capacity Problem on the Pierrefitte-Gonesse Junction (2009). [hal] [paper]
  Aurélien Merel Xavier Gandibleux Sophie Demassey Richard Lusby 10ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'09), Nancy, France. pp. 62--76.
• Relaxation lagrangienne pour le filtrage d'une contrainte-automate à coûts multiples (2009). [hal]
  Julien Menana Sophie Demassey Narendra Jussien 10ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'09), Nancy, France.
• An Optimal Constraint Programming Approach to solve the Open-Shop Problem (2009). [paper]
  Arnaud Malapert Hadrien Cambazard Christelle Guéret Narendra Jussien André Langevin Louis-Martin Rousseau Technical report CIRRELT-2009-25, CIRRELT, Montréal.
• New Filtering for the cumulative Constraint in the Context of Non-Overlapping Rectangles (2008). [hal] [paper] [slides]
  Nicolas Beldiceanu Mats Carlsson Emmanuel Poder 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'08), Paris, France. Lecture Notes in Computer Science 5015: 21--35.
• Filtering for a Continuous Multi-Resources cumulative Constraint with Resource Consumption and Production (2008). [hal] [paper] [slides]
  Emmanuel Poder Nicolas Beldiceanu International Conference on Automated Planning and Scheduling (ICAPS'08), Sidney, Australia.
• Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications (2008). [hal] [url]
  Christian Artigues and Sophie Demassey and Emmanuel Néron (ed.), ISTE/Wiley, ISBN 978-1-84821-034-9.
• Reactive approaches (2008). [hal] [url]
  Christelle Guéret Narendra Jussien In Resource-Constrained Project Scheduling -- Models, algorithms, extensions and applications, pp. 191--201. Christian Artigues and Sophie Demassey and Emmanuel Néron (ed.), ISTE/Wiley, ISBN 978-1-84821-034-9.
• Mathematical Programming Formulations and Lower Bounds for the RCPSP (2008). [hal] [url]
  Sophie Demassey In Resource-Constrained Project Scheduling -- Models, algorithms, extensions and applications, pp. 49--62. Christian Artigues and Sophie Demassey and Emmanuel Néron (ed.), ISTE/Wiley, ISBN 978-1-84821-034-9.
• Solving a Real-Time Allocation Problem with Constraint Programming (2007). [hal] [doi]
  Pierre-Emmanuel Hladik Hadrien Cambazard Anne-Marie Déplanche Narendra Jussien Journal of Systems and Software 81(1): 132--149.
• A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects (2007). [hal] [paper] [slides]
  Nicolas Beldiceanu Mats Carlsson Emmanuel Poder Rida Sadek Charlotte Truchet 13th International on Principles and Practice of Constraint Programming (CP'07), Brown, USA. Lecture Notes in Computer Science 4741: 180--194.
• A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production (2007). [hal] [paper] [slides]
  Nicolas Beldiceanu Emmanuel Poder 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'07), Brussels, Belgium. Lecture Notes in Computer Science 4150: 214--228.
• An Inventory Pick-up and Delivery Problem in the Reverse Logistics Context: Optimization using a GRASP and hybrid approach (2007). [hal] [paper]
  Émilie Grellier Pierre Dejax Narendra Jussien 7th Metaheuristics International Conference (MIC'2007), Montreal, Canada.
• Schedulability analysis of OSEK/VDX applications (2007). [paper]
  Pierre-Emmanuel Hladik Anne-Marie Déplanche Sébastien Faucou Yvon Trinquet 15th International Conference on Real-Time and Network Systems (RTNS'07), Nancy, France. pp. 131-139.
• Une contrainte cumulative continue multi-ressources avec des consommations-productions en ressources positives-négatives (2007). [hal]
  Nicolas Beldiceanu Emmanuel Poder 3èmes Journées Francophones de Programmation par Contraintes (JFPC'07), Rocquencourt, France.
• Une contrainte globale pour l'ordonnançabilité des tâches temps réel dur (2007). [hal] [paper]
  Hadrien Cambazard Pierre-Emmanuel Hladik Anne-Marie Déplanche Narendra Jussien 3èmes Journées Francophones de Programmation par Contraintes (JFPC'07), Rocquencourt, France. pp. 367--376.
• Heuristiques de construction et améliorations pour les problèmes de tournés de livraisons multi-périodiques incluant les concepts de logistique inverse (2007).
  Émilie Grellier Pierre Dejax Narendra Jussien Technical report 07-01-AUTO, École des Mines de Nantes.
• A Cost-Regular based hybrid column generation approach (2006). [hal] [doi] [paper]
  Sophie Demassey Gilles Pesant Louis-Martin Rousseau Constraints 11(4): 315-333.
• Sweep synchronisation as a global propagation mechanism (2006). [hal] [doi]
  Nicolas Beldiceanu Mats Carlsson Sven Thiel Computers and Operations Research 33(10): 2835--2851.
• Solving allocation problems of hard real-time systems with dynamic constraint programming (2006). [hal] [paper]
  Pierre-Emmanuel Hladik Hadrien Cambazard Anne-Marie Déplanche Narendra Jussien 14th International Conference on Real-Time and Network Systems (RTNS'06), Poitiers, France.
• Lower bounds computation for RCPSP (2006). [hal] [url]
  Emmanuel Néron Christian Artigues Philippe Baptiste Jacques Carlier Sophie Demassey Philippe Laborie In Perspectives in modern project scheduling, International Series in Operations Research and Management Science 92: 167-204. J. Weglarz and J. Józefowska (ed.), Springer-Verlag, ISBN 978-0-387-33643-5.
• Subcontractors scheduling on residential buildings construction sites (2006).
  Thierry Benoist Antoine Jeanjean Guillaume Rochart Hadrien Cambazard Emilie Grellier Narendra Jussien International Scheduling Symposium (ISS'06), Arcadia Ichigaya, Tokyo, Japan. pp. 32-37.
• Techniques rétrospectives pour résoudre le Minimum Open Stacks Problem (2006). [hal] [paper]
  Hadrien Cambazard Narendra Jussien 2èmes Journées Francophones de Programmation par Contraintes (JFPC'06), Nîmes, France. pp. 89-98.
• Guiding Architectural Design Process of Hard Real-Time Systems with Constraint Programming (2006). [paper]
  Pierre-Emmanuel Hladik Hadrien Cambazard Anne-Marie Déplanche Narendra Jussien 3rd Taiwanese-French Conference on Information Technology (TFIT'06), Nancy, France. pp. 317-331.
• Interactively solving school timetabling problems using extensions of constraint programming (2005). [hal] [paper]
  Hadrien Cambazard Fabien Demazeau Narendra Jussien Philippe David In Practice and Theory of Automated Timetabling V, Lecture Notes in Computer Science 3616: 190-207. Edmund K. Burke and Michael Trick (ed.), Springer-Verlag,
• Ordonnancement dynamique de projet à contraintes de ressources (2005).
  Abdallah Elkhyari Christelle Guéret Narendra Jussien In Flexibilité et Robustesse en Ordonnancement, Jean-Charles Billaut and Aziz Moukrim and Éric Sanlaville (ed.), Hermès,
• Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption (2004). [hal]
  Emmanuel Poder Nicolas Beldiceanu Éric Sanlaville European Journal of Operational Research 153: 239-254.
• Decomposition and learning for a real time task allocation problem (2004). [paper]
  Hadrien Cambazard Pierre-Emmanuel Hladik Anne-Marie Déplanche Narendra Jussien Yvon Trinquet 10th International Conference on Principles and Practice of Constraint Programming (CP'04), Toronto, Canada. Lecture Notes in Computer Science 3258: 153-167.
• Constraint programming for dynamic scheduling problems (2004). [hal] [paper]
  Abdallah Elkhyari Christelle Guéret Narendra Jussien International Scheduling Symposium (ISS'04), Awaji, Hyogo, Japan. pp. 84-89.
• Decomposition and learning for a hard real-time task allocating problem (2004).
  Hadrien Cambazard Pierre-Emmanuel Hladik Anne-Marie Déplanche Narendra Jussien Yvon Trinquet CORS/INFORMS Joint International Meeting, Banff, Alberta, Canada. vol. 3258/2004.
• Cumulated Profiles of Minimum and Maximum Resource Utilisation (2004).
  Nicolas Beldiceanu Emmanuel Poder 9th International Workshop on Project Management and Scheduling (PMS'04),
• Stable solutions for dynamic project scheduling problems (2004). [hal] [paper]
  Abdallah Elkhyari Christelle Guéret Narendra Jussien 9th International Workshop on Project Management and Scheduling (PMS'04), Nancy, France. pp. 380-384.
• Décomposition et apprentissage pour un problème d'allocation de t\^{a}ches temps-réel (2004). [paper]
  Hadrien Cambazard Pierre-Emmanuel Hladik Anne-Marie Déplanche Narendra Jussien Yvon Trinquet 10èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'04), Angers, France. pp. 123-138.
• Solving dynamic timetabling problems as dynamic resource constrained project scheduling problems using new constraint programming tools (2003). [hal] [doi] [paper]
  Abdallah Elkhyari Christelle Guéret Narendra Jussien In Practice and Theory of Automated Timetabling IV, Lecture Notes in Computer Science 2740: 39-59. E.K. Burke and P. De Causmaecker (ed.), Springer-Verlag,
• Sweep synchronisation as a global propagation mechanism (2003).
  Nicolas Beldiceanu Mats Carlsson Sven Thiel 5th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Problems (CPAIOR'03), Montréal, Canada. pp. 51 - 65.
• A New Multi-Resource cumulatives Constraint with Negative Heights (2002). [url]
  Nicolas Beldiceanu Mats Carlsson 8th International Conference on Principles and Practice of Constraint Programming (CP'02), Ithaca, NY, USA. Lecture Notes in Computer Science 2470: 63-79.
• Conflict-based repair techniques for solving dynamic scheduling problems (2002). [hal] [paper]
  Abdallah Elkhyari Christelle Guéret Narendra Jussien 8th International Conference on Principles and Practice of Constraint Programming (CP'02), Ithaca, NY, USA. Lecture Notes in Computer Science 2470: 702-707.
• New tools for solving dynamic timetabling problems (2002). [hal]
  Abdallah Elkhyari Christelle Guéret Narendra Jussien 4th International Conference on the Practice And Theory of Automated Timetabling (PATAT'02), Gent, Belgium. pp. 112-114.
• Using intelligent backtracking to improve branch and bound methods: an application to Open-Shop problems (2000). [hal] [paper]
  Christelle Guéret Narendra Jussien Christian Prins European Journal of Operational Research 127(2): 344-354.
• Cumulative constraint for trapezoid resource requirement (2000).
  Emmanuel Poder Nicolas Beldiceanu 17th International Symposium on Mathematical Programming (ISMP'00), Atlanta, USA.
• Combining AI/OR techniques for solving Open Shop problems (1999). [paper]
  Christelle Guéret Narendra Jussien 1st International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Problems (CPAIOR'99), Ferrara, Italy. pp. 25-26.
• Parallel machine scheduling with calendar rules (1998).
  Nicolas Beldiceanu 6th International Workshop on Project Management and Scheduling (PMS'98), Istanbul, Turkey.
• Using intelligent backtracking to improve branch and bound methods: an application to Open-Shop problems (1998). [hal] [paper]
  Christelle Guéret Narendra Jussien Christian Prins 6th International Workshop on Project Management and Scheduling (PMS'98), Istanbul, Turkey.
• Building University timetables using Constraint Logic Programming (1996). [paper]
  Christelle Guéret Narendra Jussien Patrice Boizumault Christian Prins In Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 1153: 130-145. Edmund Burke and Peter Ross (ed.), Springer-Verlag,
• Solving Resource-constrained Project Scheduling Problems with CHIP (1996).
  Nicolas Beldiceanu Éric Bourreau David Rivreau Helmut Simonis 5th International Workshop on Project Management and Scheduling (PMS'96), Poznań. pp. 35-38.
• Introducing Global Constraints in CHIP (1994). [hal]
  Nicolas Beldiceanu Evelyne Contejean Mathl. Comput. Modelling 20(12): 97-123.
• Efficient labeling and Constraint Relaxation for Solving Time Tabling Problems (1994). [paper]
  Patrice Boizumault Christelle Guéret Narendra Jussien ILPS'94 Workshop on Constraint Languages/Systems and their use in Problem Modeling, ECRC, Munich, Germany. Technical Report ECRC-94-38 1
• Extending CHIP in order to Solve Complex Scheduling and Placement Problems (1993). [hal]
  Abderrahmane Aggoun Nicolas Beldiceanu Mathl. Comput. Modelling 17(7): 57-73.
• Extending CHIP to solve complex scheduling and packing problems (1992).
  Abderrahmane Aggoun Nicolas Beldiceanu 1ères Journées Francophones de Programmation en Logique et avec Contraintes (JFPLC'92), Lille, France.

placement

• A Scalable Sweep Algorithm for the cumulative and bin-packing Constraints (2012).
  Arnaud Letort Fourth International Workshop on Bin Packing and Placement Constraints (CPAIOR-BPPC'12), Nantes, France.
• Bin-Repacking Scheduling in Virtualized Datacenters (2011).
  Fabien Hermenier Sophie Demassey Xavier Lorca 17th International Conference on Principles and Practice of Constraint Programming (CP'11), Perrugia, Italy. Lecture Notes in Computer Science
• A Constraint Programming Approach for a Batch Processing Problem with Non-identical Job Sizes (2011). [paper]
  Arnaud Malapert Christelle Guéret Louis-Martin Rousseau Technical report 11-06-AUTO, École des Mines de Nantes.
• New Filtering for the cumulative Constraint in the Context of Non-Overlapping Rectangles (2010). [doi]
  Nicolas Beldiceanu Mats Carlsson Sophie Demassey Emmanuel Poder Annals of Operations Research 184(1): 27-50.
• Integrating Rule-Based Modelling and Constraint Programming for Solving Industrial Packing Problems (2010). [url]
  Abder Aggoun Nicolas Beldiceanu Mats Carlsson Fran\ccois Fages ERCIM News 2010(81)
• Six Ways of Integrating Symmetries within Non-Overlapping Constraints (2009). [hal] [doi] [slides]
  Magnus \rAgren Nicolas Beldiceanu Mats Carlsson Mohammed Sbihi Charlotte Truchet Stéphane Zampelli 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), Pittsburgh, USA. Lecture Notes in Computer Science 5547: 11--25.
• Entropy: a Consolidation Manager for Clusters (2009). [hal] [doi]
  Fabien Hermenier Xavier Lorca Jean-Marc Menaud Gilles Müller Julia Lawall ACM International Conference on Virtual Execution Environments (VEE'09), pp. 41--50.
• Six Ways of Integrating Symmetries within Non-Overlapping Constraints (2009). [paper]
  Magnus \rAgren Nicolas Beldiceanu Mats Carlsson Mohammed Sbihi Charlotte Truchet Stéphane Zampelli Technical report T2009-01, Swedish Institute of Computer Science.
• New Filtering for the cumulative Constraint in the Context of Non-Overlapping Rectangles (2008). [hal] [paper] [slides]
  Nicolas Beldiceanu Mats Carlsson Emmanuel Poder 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'08), Paris, France. Lecture Notes in Computer Science 5015: 21--35.
• Two-dimensional Pickup and Delivery Routing Problem with Loading Constraints (2008). [hal]
  Arnaud Malapert Christelle Guéret Narendra Jussien André Langevin Louis-Martin Rousseau CPAIOR'08 1st Workshop on Bin Packing and Placement Constraints (BPPC'08), Paris, France.
• Reconfiguration dynamique du placement dans les grilles de calcul dirigée par les objectifs (2008). [hal] [paper]
  Fabien Hermenier Xavier Lorca Hadrien Cambazard Jean-Marc Menaud Narendra Jussien 6ème Conférence Française sur les Systèmes d'Exploitation (CFSE'08), Fribourg, France.
• Entropy: a Consolidation Manager for Clusters (2008). [hal] [paper]
  Fabien Hermenier Xavier Lorca Jean-Marc Menaud Gilles Müller Julia Lawall Technical report 6639, INRIA Rennes.
• A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules (2008). [paper]
  Nicolas Beldiceanu Mats Carlsson Julien Martin Technical report T2008-04, Swedish Institute of Computer Science.
• Two-Dimensional Pickup and Delivery Routing Problem with Loading Constraints (2008). [paper]
  Arnaud Malapert Christelle Guéret Narendra Jussien André Langevin Louis-Martin Rousseau Technical report CIRRELT-2008-37, Centre Inter-universitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport.
• A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects (2007). [hal] [paper] [slides]
  Nicolas Beldiceanu Mats Carlsson Emmanuel Poder Rida Sadek Charlotte Truchet 13th International on Principles and Practice of Constraint Programming (CP'07), Brown, USA. Lecture Notes in Computer Science 4741: 180--194.
• A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects (2007). [paper]
  Nicolas Beldiceanu Emmanuel Poder Rida Sadek Mats Carlsson Charlotte Truchet Technical report T2007-08, Swedish Institute of Computer Science.
• Non-overlapping Constraints between Convex Polytopes (2001). [url]
  Nicolas Beldiceanu Qi Guo Sven Thiel 7th International Conference on Principles and Practice of Constraint Programming (CP'01), Paphos, Cyprus. Lecture Notes in Computer Science 2239: 392-407.
• Sweep as a Generic Pruning Technique Applied to the Non-Overlapping Rectangles Constraints (2001).
  Nicolas Beldiceanu Mats Carlsson 7th International Conference on Principles and Practice of Constraint Programming (CP'01), Paphos, Cyprus. Lecture Notes in Computer Science 2239: 377-391.
• Sweep as a Generic Pruning Technique Applied to Constraint Relaxation (2001). [slides]
  Nicolas Beldiceanu Mats Carlsson CP'01 3rd Workshop on Soft Constraints (Soft'01), Paphos, Cyprus. pp. 43-55.
• Sweep as a generic pruning technique (2000).
  Nicolas Beldiceanu CP'00 Workshop on Techniques foR Implementing Constraint programming (TRICS), Singapore.
• A Note on Perfect Square Placement (1999). [paper]
  Helmut Simonis, Éric Bourreau et Nicolas Beldiceanu Technical report , .
• Introducing Global Constraints in CHIP (1994). [hal]
  Nicolas Beldiceanu Evelyne Contejean Mathl. Comput. Modelling 20(12): 97-123.
• Extending CHIP in order to Solve Complex Scheduling and Placement Problems (1993). [hal]
  Abderrahmane Aggoun Nicolas Beldiceanu Mathl. Comput. Modelling 17(7): 57-73.
• Extending CHIP to solve complex scheduling and packing problems (1992).
  Abderrahmane Aggoun Nicolas Beldiceanu 1ères Journées Francophones de Programmation en Logique et avec Contraintes (JFPLC'92), Lille, France.

transport

• Improving the Asymmetric TSP by Considering Graph Structure (2012). [paper]
  Jean-Guillaume Fages Xavier Lorca Technical report 12-4-INFO, Ecole des Mines de Nantes, TASC(LINA/CNRS/INRIA).
• Revisiting the tree Constraint (2011).
  Jean-Guillaume Fages Xavier Lorca 17th International Conference on Principles and Practice of Constraint Programming (CP'11), Perrugia, Italy. Lecture Notes in Computer Science
• Tree-based Graph Partitioning Constraint (2011). [url]
  Xavier Lorca ISTE/Wiley, ISBN 978-1-84821-303-6.
• Un algorithme de génération de colonnes pour le problème de capacité d'infrastructure ferroviaire (2010). [hal]
  Aurélien Merel Sophie Demassey Xavier Gandibleux 11ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'10), Toulouse, France.
• An improved Upper Bound for the Railway Infrastructure Capacity Problem on the Pierrefitte-Gonesse Junction (2009). [hal] [paper]
  Aurélien Merel Xavier Gandibleux Sophie Demassey Richard Lusby 10ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'09), Nancy, France. pp. 62--76.
• Combining tree Partitioning, Precedence, and Incomparability Constraints (2008). [hal] [doi] [paper]
  Nicolas Beldiceanu Pierre Flener Xavier Lorca Constraints 13(4): 459--489.
• Multiperiodic VRP models and hybrid solution techniques for closed loops-reverse logistics (2008). [paper]
  Émilie Grellier Pierre Dejax Narendra Jussien International Workshop on Vehicle Routing in Practice (VIP'08), Oslo, Norway.
• Optimisation des tournées de véhicules dans le cadre de la logistique inverse : modélisation et résolution par des méthodes hybrides (2008). [hal]
  Émilie Grellier PhD Thesis, Université de Nantes.
• Two-Dimensional Pickup and Delivery Routing Problem with Loading Constraints (2008). [paper]
  Arnaud Malapert Christelle Guéret Narendra Jussien André Langevin Louis-Martin Rousseau Technical report CIRRELT-2008-37, Centre Inter-universitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport.
• Necessary Condition for Path Partitioning Constraints (2007). [hal] [paper] [slides]
  Nicolas Beldiceanu Xavier Lorca 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'07), Brussels, Belgium. Lecture Notes in Computer Science 4150: 141-154.
• Condition nécessaire pour la contrainte de partitionnement de graphes par des chemins (2007). [hal] [url]
  Nicolas Beldiceanu Xavier Lorca 3èmes Journées Francophones de Programmation par Contraintes (JFPC'07), Rocquencourt, France. pp. 297--305.
• Problème de tournées de collectes et livraisons multi-périodique : résolution grâce au GRASP (2007). [paper]
  Émilie Grellier Pierre Dejax Narendra Jussien 5èmes journées francophones de Recherche Opérationnelle (FRANCORO V/ROADEF'07), Grenoble, France.
• Contraintes de partitionnement de graphe (2007). [hal] [paper]
  Xavier Lorca PhD Thesis, Université de Nantes.
• Vehicle routing problem in mixed flows for reverse logistics: a modeling framework (2006). [paper]
  Émilie Grellier Pierre Dejax Narendra Jussien Zhiqiang Lu International Conference on Information Systems, Logistics, and Supply Chain (ILS'06), Lyon, France.
• Partitionnement de graphes par des arbres sous contraintes de degré (2006). [hal] [paper]
  Nicolas Beldiceanu Pierre Flener Xavier Lorca 2èmes Journées Francophones de Programmation par Contraintes (JFPC'06), Nîmes, France. pp. 35-43.
• A Column Generation Model and Constraint Programming Techniques for solving an Inventory Routing Problem in Mixed Flows (2006). [paper]
  Émilie Grellier Pierre Dejax Narendra Jussien Zhiqiang Lu 3rd International Workshop on Freight Transportation and Logistics (ODYSSEUS'06), Altea, Spain.
• Tournées de collectes et livraisons dans le cadre de la logistique inverse (2006). [paper]
  Émilie Grellier Pierre Dejax Narendra Jussien Zhiqiang Lu 7ème congrès de la Société Fran\c{c}aise de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'06), Lille, France.
• Le problème de construction de tournées avec gestion de stocks : résolution par la méthode GRASP (2005).
  Émilie Grellier Pierre Dejax Yazid Mati 6ème congrès de la société Fran\c{c}ais de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'05), Tours, France. pp. 193-194.
• Introducing Global Constraints in CHIP (1994). [hal]
  Nicolas Beldiceanu Evelyne Contejean Mathl. Comput. Modelling 20(12): 97-123.

bioinformatique

• Contraintes de partitionnement de graphe (2007). [hal] [paper]
  Xavier Lorca PhD Thesis, Université de Nantes.
• Partitionnement de graphes par des arbres sous contraintes de degré (2006). [hal] [paper]
  Nicolas Beldiceanu Pierre Flener Xavier Lorca 2èmes Journées Francophones de Programmation par Contraintes (JFPC'06), Nîmes, France. pp. 35-43.
• Combining Tree Partitioning, Precedence, Incomparability, and Degree Constraints, with an Application to Phylogenetic and Ordered-Path Problems (2006). [paper]
  Nicolas Beldiceanu Pierre Flener Xavier Lorca Technical report 2006-020, Department of Information Technology, Uppsala University, Sweden.
• Multiplex dispensation order generation for pyrosequencing (2004). [paper]
  Mats Carlsson Nicolas Beldiceanu CP'04 Workshop on CSP Techniques with Immediate Application,
• Dispensation order generation for pyrosequencing (2004).
  Mats Carlsson Nicolas Beldiceanu 2nd Asia Pacific Bioinformatics Conference, vol. 29.

graphique

• A Spatio-temporal Reasoning System for Virtual Camera Planning (2009). [hal] [doi]
  Fabrice Lamarche Marc Christie Frédéric Benhamou 9th International Symposium on Smart Graphics (SG'09), Salamanca, Espagne. pp. 119-127.
• Placement de caméra en environnements virtuels (2008).
  Jean-Marie Normand PhD Thesis, Université de Nantes.
• Occlusion-free Camera Control (2008). [hal]
  Marc Christie Patrick Olivier Jean-Marie Normand Technical report 6640, INRIA Rennes.
• Peeking in Solver Strategies Using Explanations -- Visualization of Dynamic Graphs for Constraint Programming (2005).
  Mohammad Ghoniem Hadrien Cambazard Jean-Daniel Fekete Narendra Jussien ACM symposium on Software Visualization (SOFTVIS'05), Saint-Louis, MO, USA. pp. 27-36.
• Complex Constraint Abstraction: Global Constraint Visualization. Lecture (2000).
  Helmut Simonis Abderrahmane Aggoun Nicolas Beldiceanu Éric Bourreau In Analysis and Vizualisation Tools for Constraint Programming, Lecture Notes in Computer Science 1870: 299-317. Pierre Deransart and Manuel V. Hermenegildo and Jan Maluszyński (ed.), Springer-Verlag,

règles métiers

• Three Generalizations of the FOCUS Constraint (2013).
  Nina Narodytska Thierry Petit Mohamed Siala Toby Walsh IJCAI, 23rd International Joint Conference on Artificial Intelligence,
• Three Generalizations of the FOCUS Constraint (extended version including proofs) (2013).
  Nina Narodytska Thierry Petit Mohamed Siala Toby Walsh CoRR abs/1304.5970
• Bin-Repacking Scheduling in Virtualized Datacenters (2011).
  Fabien Hermenier Sophie Demassey Xavier Lorca 17th International Conference on Principles and Practice of Constraint Programming (CP'11), Perrugia, Italy. Lecture Notes in Computer Science
• Modélisation et optimisation des préférences en planification de personnel (2010). [paper]
  Julien Menana Sophie Demassey Narendra Jussien Technical report 11-01-INFO, École des Mines de Nantes.
• Sequencing and counting with the multicost-regular constraint (2009). [hal] [doi] [paper]
  Julien Menana Sophie Demassey 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), Pittsburgh, USA. Lecture Notes in Computer Science 5547: 178--192.
• Séquencer et compter avec la contrainte multicost-regular (2009). [hal] [paper]
  Julien Menana Sophie Demassey 5èmes Journées Francophones de Programmation par Contraintes (JFPC'09), Orléans, France. pp. 125--134.
• Compiling Business Rules in a Geometric Constraint over k-Dimensional Objects and Shapes (2009). [paper]
  Mats Carlsson Nicolas Beldiceanu Julien Martin Technical report T2009-02, Swedish Institute of Computer Science.
• A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules (2008). [hal] [doi] [paper] [slides]
  Mats Carlsson Nicolas Beldiceanu Julien Martin 14th International Conference on Principles and Practice of Constraint Programming (CP'08), Sidney, Australia. Lecture Notes in Computer Science 5202: 220--234.
• A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules (2008). [paper]
  Nicolas Beldiceanu Mats Carlsson Julien Martin Technical report T2008-04, Swedish Institute of Computer Science.
• A Cost-Regular based hybrid column generation approach (2006). [hal] [doi] [paper]
  Sophie Demassey Gilles Pesant Louis-Martin Rousseau Constraints 11(4): 315-333.
• Parallel machine scheduling with calendar rules (1998).
  Nicolas Beldiceanu 6th International Workshop on Project Management and Scheduling (PMS'98), Istanbul, Turkey.

symmétries

• Six Ways of Integrating Symmetries within Non-Overlapping Constraints (2009). [paper]
  Magnus \rAgren Nicolas Beldiceanu Mats Carlsson Mohammed Sbihi Charlotte Truchet Stéphane Zampelli Technical report T2009-01, Swedish Institute of Computer Science.
• Revisiting the Lexicographic Ordering Constraint (2002). [paper]
  Mats Carlsson Nicolas Beldiceanu Technical report T2002-17, Swedish Institute of Computer Science.
• Arc-Consistency for a Chain of Lexicographic Ordering Constraints (2002). [paper]
  Mats Carlsson Nicolas Beldiceanu Technical report T2002-18, Swedish Institute of Computer Science.

robotique autonome

• Multi-Agent Electro-Location and the Among Constraint (2011). [hal] [paper]
  Gilles Chabert Frédéric Boyer Sophie Demassey Technical report 00598712, INRIA.
• A Constraint on the Number of Distinct Vectors with Application to Localization (2009). [hal] [paper]
  Gilles Chabert Luc Jaulin Xavier Lorca 15th International Conference on Principles and Practice of Constraint Programming (CP'09), Lecture Notes in Computer Science 5732: 196-210.

autre

• Three Generalizations of the FOCUS Constraint (2013).
  Nina Narodytska Thierry Petit Mohamed Siala Toby Walsh IJCAI, 23rd International Joint Conference on Artificial Intelligence,
• La recherche locale pour la pr\'{e}-programmation d'environnements urbains durables (2013). [paper]
  Bruno Belin Marc Christie Charlotte Truchet Actes JFPC 2013,
• Describing and Generating Solutions for the EDF Unit Commitment Problem with the ModelSeeker (2013).
  Nicolas Beldiceanu Helmut Simonis 19th International Conference on Principles and Practice of Constraint Programming (CP'13), Uppsala, Sweden. Lecture Notes in Computer Science
• Three Generalizations of the FOCUS Constraint (extended version including proofs) (2013).
  Nina Narodytska Thierry Petit Mohamed Siala Toby Walsh CoRR abs/1304.5970
• Towards Interactive Urban Planning with Local Search Techniques (2012). [paper]
  Belin, Bruno Christie, Marc 25th Europen conference on operational research (EURO 2012), Vilnius, Lithuania.
• Interactive Urban Planning with Local Search Techniques: the SUSTAINS Project (2012). [url]
  Belin, Bruno Christie, Marc Truchet, Charlotte 3rd International Conference on Computational Sustainability (CompSust'12), Copenhagen, Denmark.
• Constraint Programming in Music (2011). [url]
  Charlotte Truchet and Gérard Assayag (ed.), ISTE/Wiley, ISBN 978-1-84821-288-6.
• The increasing-nvalue Constraint (2010). [paper] [slides]
  Nicolas Beldiceanu Fabien Hermenier Xavier Lorca Thierry Petit 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'10), Bologna, Italy. Lecture Notes in Computer Science 6140: 25--39.
• La contrainte increasing-nvalue (2010). [hal] [paper]
  Nicolas Beldiceanu Fabien Hermenier Xavier Lorca Thierry Petit 6èmes Journées Francophones de Programmation par Contraintes (JFPC'10), pp. 71-81.
• Sonet Network Design Problems (2009). [hal] [doi]
  Marie Pelleau Pascal Van Hentenryck Charlotte Truchet 6th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS'09), pp. 81-95.
• Learning from the past to dynamically improve search: a case study on the MOSP problem (2008). [hal] [paper]
  Hadrien Cambazard Narendra Jussien Post-proceedings volume on Learning and Intelligent OptimizatioN (LION II), Lecture Notes in Computer Science 5313: 69--80.
• Learning from the past to dynamically improve search: a case study on the MOSP problem (2007). [paper]
  Hadrien Cambazard Narendra Jussien International Conference on Learning and Intelligent OptimizatioN (LION II),
• Solving the Minimum number of Open Stacks Problem with explanation-based techniques (2007). [paper]
  Hadrien Cambazard Narendra Jussien AAAI'07 Workshop Explanation-aware Computing (ExaCt'07), Vancouver, Canada.
• A to Z of sudoku (2007). [url]
  Narendra Jussien ISTE, ISBN 978-1-84704-000-8.
• Les contraintes au secours du décisionnel (2007).
  Narendra Jussien Table ronde de la session industrielle des JFPC 2007.
• On-Line Resources Allocation for ATM Networks with Rerouting (2006). [hal]
  Samir Loudni Patrice Boizumault Philippe David Computer and Operations Research 33(10): 2891--2917.
• Évaluer la difficulté d'une grille de Sudoku à l'aide d'un modèle contraintes (2006). [hal] [paper]
  François Laburthe Guillaume Rochart Narendra Jussien 2èmes Journées Francophones de Programmation par Contraintes (JFPC'06), Nîmes, France. pp. 239-248.
• Résolution de problèmes combinatoires par des approches fondées sur la notion d'explication (2006). [hal] [paper]
  Hadrien Cambazard PhD Thesis, Université de Nantes.
• Les couleurs du sudoku (2006). [paper]
  Narendra Jussien Sudoku de la Fédération Française 6: 5.
• Évaluer la difficulté d'une grille de sudoku (2006). [paper]
  Narendra Jussien Sudoku de la Fédération Française 5: 5.
• Sudoku et programmation par contraintes (2006). [paper]
  Narendra Jussien Sudoku de la Fédération Française 3: 5.
• De l'information à la décision: approche prospective du décisionnel (2006). [url]
  Narendra Jussien Soirée Atlanticiels -- le rendez-vous TIC de la métropole Nantes-Atlantique.
• A musical overconstrained CSP and its cost-functions issues (2005).
  Charlotte Truchet Conference of the International Federation of Operational Research Societies (IFORS'05),
• How to solve allocation problems with constraint programming (2005). [paper]
  Pierre-Emmanuel Hladik Hadrien Cambazard Anne-Marie Déplanche Narendra Jussien Work In Progress of the 17th Euromicro Conference on real time systems (ECRTS'05), Palma de Mallorca, Spain. pp. 25-28.
• Dynamic constraint programming for solving hard real-time allocation problems (2005). [paper]
  Pierre-Emmanuel Hladik Hadrien Cambazard Anne-Marie Déplanche Narendra Jussien Technical report 2005-7, IRCCyN.
• Solving Musical Constraints with Adaptive Search (2004).
  Charlotte Truchet Philippe Codognet Soft Computing 8(9): 633-640.
• Interactively solving school timetabling problems using extensions of constraint programming (2004). [paper]
  Hadrien Cambazard Fabien Demazeau Narendra Jussien Philippe David Practice and Theory of Automated Timetabling (PATAT'04), Pittsburgh, PA USA. pp. 107-124.
• No Java without Caffeine -- A tool for dynamic analysis of Java programs (2002). [paper]
  Yann-Ga\"{e}l Guéhéneuc Rémi Douence Narendra Jussien 17th IEEE Conference on Automated Software Engineering (ASE'02), Edinburgh, UK. pp. 117-126.
• Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together (2001). [paper]
  Hervé Albin-Amiot Pierre Cointe Yann-Ga\"{e}l Guéhéneuc Narendra Jussien 16th IEEE conference on Automated Software Engineering (ASE'01), San Diego, USA. pp. 166-173.
• Using explanations for design-patterns identification (2001). [paper]
  Yann-Ga\"{e}l Guéhéneuc Narendra Jussien IJCAI'01 Workshop on Modelling and Solving problems with constraints, Seattle, WA, USA. pp. 57-64.