TASC Research Team Bibliography

HAL collection: LINA-CONTRAINTES

bibtex file: lina-constraints.bib

2013

• 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
• Prediction of Parallel Speed-ups for Las Vegas Algorithms (2013).
  Charlotte Truchet Florian Richoux Philippe Codognet 2013 International Conference on Parallel Processing (ICPP'13),
• Propagation Engine Prototyping with a Domain Specific Language (2013).
  Charles Prud'homme Xavier Lorca Rémi Douence Narendra Jussien Constraints, to appear
• Three Generalizations of the FOCUS Constraint (2013).
  Nina Narodytska Thierry Petit Mohamed Siala Toby Walsh IJCAI, 23rd International Joint Conference on Artificial Intelligence,
• Asynchronous Forward Bounding Revisited (2013).
  Mohamed Wahbi Redouane Ezzahir Christian Bessiere 19th International Conference on Principles and Practice of Constraint Programming (CP'13), Uppsala, Sweden. Lecture Notes in Computer Science: 708--723.
• Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems (2013). [url]
  Mohamed Wahbi Wiley-ISTE, ISBN 978-1-84821-594-8.
• Nogood-based asynchronous forward checking algorithms (2013). [doi] [url]
  Mohamed Wahbi Redouane Ezzahir Christian Bessiere ElHoussine Bouyakhf Constraints 18(3): 404--433.
• Maintien asynchrone de la consistance d'arc dans la recherche distribuée synchrone (2013).
  Mohamed Wahbi Redouane Ezzahir Christian Bessiere ElHoussine Bouyakhf 9ème Journées Francophones de Programmation par Contraintes, Aix-en-Provence, France. pp. 347--356.
• Une approche basée sur les contraintes pour résoudre le problème d?arbre recouvrant de coût minimum avec contraintes de degré (2013).
  Jean-Guillaume Fages Xavier Lorca Louis-Martin Rousseau 9 emes Journées Francophones de Programmation par Contraintes (JFPC'13), Aix-en-Provence, France. pp. 119-122.
• Prototyper des Moteurs de Propagation avec un DSL (2013).
  Charles Prud'homme Xavier Lorca Rémi Douence Narendra Jussien 9èmes Journées Francophones de Programmation par Contraintes(JFPC'13),
• La recherche locale pour la pr\'{e}-programmation d'environnements urbains durables (2013). [paper]
  Bruno Belin Marc Christie Charlotte Truchet Actes JFPC 2013,
• When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent (2013).
  Jérémie Du Boisberranger Danièle Gardy Xavier Lorca Charlotte Truchet Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics (ANALCO2013), New Orleans, Louisiana, USA. pp. 80-90.
• A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint (2013).
  Arnaud Letort Mats Carlsson Nicolas Beldiceanu Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference (CPAIOR'13), Yorktown Heights, NY, USA. Lecture Notes in Computer Science 7874: 144-159.
• GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials (2013).
  Naina Razakarison Nicolas Beldiceanu Mats Carlsson Helmut Simonis The Sixth Annual Symposium on Combinatorial Search (SOCS'13), Leavenworth, WA, USA.
• A Parametric Propagator for Discretely Convex Pairs of Sum Constraints (2013).
  Jean-No\?el Monette Nicolas Beldiceanu Pierre Flener Justin Pearson 19th International Conference on Principles and Practice of Constraint Programming (CP'13), Uppsala, Sweden. Lecture Notes in Computer Science
• 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
• Extraction de régions intérieures pour améliorer le majorant en optimisation globale sous contraintes (2013). [paper]
  Ignacio Araya Gilles Trombettoni Bertrand Neveu Gilles Chabert JFPC - 9\`{e}mes Journées Francophones de Programmation par Contraintes (JFPC 2013),
• Three Generalizations of the FOCUS Constraint (extended version including proofs) (2013).
  Nina Narodytska Thierry Petit Mohamed Siala Toby Walsh CoRR abs/1304.5970
• A Constraint Solver based on Abstract Domains (2013).
  Marie Pelleau Antoine Mine Charlotte Truchet Frederic Benhamou 14th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI2013), Romas, Italy. Lecture Notes in Computer Science

2012

• An Optimal Constraint Programming Approach to the Open-Shop Problem (2012). [doi] [url]
  Arnaud Malapert Hadrien Cambazard Christelle Guéret Narendra Jussien André Langevin Louis-Martin Rousseau INFORMS Journal on Computing -(24): 228 - 244.
• IbexOpt : un module d'optimisation globale sous contraintes fiable (2012). [paper]
  Gilles Trombettoni Ignacio Araya Bertrand Neveu Gilles Chabert ROADEF 2012,
• UpperBounding in Inner Regions for Global Optimization under Inequality Constraints (2012). [paper]
  Ignacio Araya Gilles Trombettoni Bertrand Neveu Gilles Chabert Global Optimization Workshop (GOW 12),
• The Conjunction of Interval AMONG Constraints (2012).
  Gilles Chabert Sophie Demassey 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12), Lectures Notes in Computer Science 7298: 113--128.
• 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.
• A Scalable Sweep Algorithm for the cumulative Constraint (2012).
  Arnaud Letort Nicolas Beldiceanu Mats Carlsson 8th International Conference on Principles and Practice of Constraint Programming (CP'12), Quebec City, Canada. Lecture Notes in Computer Science
• Focus: A Constraint for Concentrating High Costs (2012).
  Thierry Petit 18th International Conference on Principles and Practice of Constraint Programming (CP'12), Quebec City, Canada. Lecture Notes in Computer Science
• Focus: A Constraint for Concentrating High Costs (2012).
  Thierry Petit Proc. First International Workshop on Search Strategies and Non-standard Objectives, (CPAIOR-SSNOW'12), Nantes, France.
• An O(n log n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization (2012).
  Nicolas Beldiceanu Mats Carlsson Thierry Petit Jean-Charles Regin European Conference on Artificial Intelligence (ECAI'12), Montpellier, France.
• Intermediary Local Consistencies (2012).
  Thierry Petit European Conference on Artificial Intelligence (ECAI'12), Montpellier, France.
• Parallel Local Search for the Costas Array Problem (2012).
  Daniel Diaz Florian Richoux Yves Caniou Philippe Codognet Salvador Abreu Parallel Computing and Optimization (IPDPS-PCO?12), Shanghai, China.
• Constraint-based Local Search for the Costas Array Problem (2012).
  Daniel Diaz Florian Richoux Philippe Codognet Yves Caniou Salvador Abreu Learning and Intelligent OptimizatioN Conference (LION 6), Paris, France.
• Performance Analysis of Parallel Constraint-Based Local Search (2012).
  Yves Caniou Daniel Diaz Florian Richoux Philippe Codognet Salvador Abreu 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'12), New Orleans, LA, USA.
• 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12) (2012). [doi]
  Editors: Nicolas Beldiceanu Narendra Jussien Eric Pinson , Nantes, France. Lectures Notes in Computer Science 7298
• 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.
• Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search (2012). [doi]
  Wahbi, Mohamed Ezzahir, Redouane Bessiere, Christian Bouyakhf, El Houssine 24th International Conference on Tools with Artificial Intelligence (ICTAI'12), Athens, Greece. vol. 1. pp. 33--40.
• Problemes d'optimisation sur des séquences (2012).
  Thierry Petit 8emes Journees Francophones de Programmation par Contraintes (JFPC'12), Toulouse, France. pp. 3--3.
• 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).
• Intermediary Local Consistencies (2012).
  Thierry Petit Technical report 12-1-INFO, Ecole des Mines de Nantes, TASC(LINA/CNRS/INRIA).

2011

• 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.
• Global Propagation of Side Constraints for Solving Over-constrained Problems (2011). [hal] [doi] [paper]
  Thierry Petit Emmanuel Poder Annals of Operations Research 184(1): 295-314.
• 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)
• Filtering Algorithms for Discrete Cumulative Problems with Over-loads of Resource (2011).
  Alexis De Clercq Thierry Petit Nicolas Beldiceanu Narendra Jussien 17th International Conference on Principles and Practice of Constraint Programming (CP'11), Perrugia, Italy. Lecture Notes in Computer Science
• Octagonal Domains for Continuous Constraints (2011).
  Marie Pelleau Charlotte Truchet Frédéric Benhamou 17th International Conference on Principles and Practice of Constraint Programming (CP'11), Perrugia, Italy. Lecture Notes in Computer Science
• 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
• A Theta(n) Bound-Consistency Algorithm for the Increasing Sum Constraint (2011).
  Thierry Petit Jean-Charles Régin Nicolas Beldiceanu 17th International Conference on Principles and Practice of Constraint Programming (CP'11), Perrugia, Italy. Lecture Notes in Computer Science
• A Constraint Seeker: Finding and Ranking Global Constraints from Examples (2011).
  Nicolas Beldiceanu Helmut Simonis 17th International Conference on Principles and Practice of Constraint Programming (CP'11), Perrugia, Italy. Lecture Notes in Computer Science
• 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
• The Objective Sum Constraint (2011).
  Jean-Charles Régin Thierry Petit 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'11), Berlin, Germany. Lecture Notes in Computer Science
• A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints (2011). [paper]
  Thierry Petit Nicolas Beldiceanu Xavier Lorca 22th International Joint Conference on Artificial Intelligence (IJCAI'11),
• A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints: Revised Edition that Incorporates One Correction (2011). [paper]
  Thierry Petit Nicolas Beldiceanu Xavier Lorca CoRR abs/1110.4719
• Inner Regions and Interval Linearizations for Global Optimization (2011). [paper]
  Gilles Trombettoni Ignacio Araya Bertrand Neveu Gilles Chabert AAAI, pp. 99--104.
• Tree-based Graph Partitioning Constraint (2011). [url]
  Xavier Lorca ISTE/Wiley, ISBN 978-1-84821-303-6.
• Constraint Programming in Music (2011). [url]
  Charlotte Truchet and Gérard Assayag (ed.), ISTE/Wiley, ISBN 978-1-84821-288-6.
• 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),
• Au-delà des produits cartésiens de domaines : l'exemple des octogones (2011).
  Marie Pelleau Charlotte Truchet Frédéric Benhamou 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.
• 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 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.
• Régions intérieures et linéarisations par intervalles en optimisation globale (2011). [paper]
  Gilles Trombettoni Ignacio Araya Bertrand Neveu Gilles Chabert JFPC - 7\`{e}mes Journées Francophones de Programmation par Contraintes (JFPC 2011),

2010

• The Ordered Distribute Constraint (2010). [hal] [paper]
  Thierry Petit Jean-Charles Régin 22th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'10),
• Efficient Algorithms for Singleton Arc Consistency (2010). [hal] [doi] [paper]
  Christian Bessiere Stephane Cardon Romuald Debruyne Christophe Lecoutre Constraints 16(1): 25-53.
• Improving Inter-Block Backtracking with Interval Newton (2010). [doi] [paper]
  Bertrand Neveu Gilles Trombettoni Gilles Chabert Constraints 15(1): 93-116.
• 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.
• Resolution of Nonlinear Interval Problems using Symbolic Interval Arithmetic (2010). [doi] [paper]
  Luc Jaulin Gilles Chabert Engineering Applications of Artificial Intelligence 23(6)
• Sweeping with Continous Domains (2010). [slides]
  Gilles Chabert Nicolas Beldiceanu 16th International Conference on Principles and Practice of Constraint Programming (CP'10), St Andrews, Scotland. Lecture Notes in Computer Science 6308: 137--151.
• A Box-Consistency Contractor based on Extremal Functions (2010).
  Gilles Trombettoni Yves Papegay Gilles Chabert Odile Pourtallier 16th International Conference on Principles and Practice of Constraint Programming (CP'10), St Andrews, Scotland. Lecture Notes in Computer Science 6308: 491--498.
• 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.
• 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.
• Abstract Domains for Constraint Programming, with the Example of Octagons (2010). [doi]
  Charlotte Truchet Marie Pelleau Frédéric Benhamou 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 72-79.
• 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 generic scheme for integrating strong consistencies into constraint solvers (2010). [paper]
  Julien Vion Thierry Petit Narendra Jussien Recent Advances in Constraints, Revised Selected Papers from CSCLP'09., Lecture Notes in Computer Science 6384
• 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.
• 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.
• 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.
• 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)
• Global Constraint Catalog, 2nd Edition (2010). [url]
  Nicolas Beldiceanu Mats Carlsson Jean-Xavier Rampon Technical report T2010-07, Swedish Institute of Computer Science.
• A GAC Algorithm for a Class of Global Counting Constraints (2010). [paper]
  Nicolas Beldiceanu Xavier Lorca Thierry Petit Technical report 10-01-INFO, École des Mines de Nantes.
• 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.

2009

• Contractor Programming (2009). [hal] [doi] [paper]
  Gilles Chabert Luc Jaulin Artificial Intelligence 173(11): 1079-1100.
• Undirected Forest Constraints (2009). [hal] [doi]
  Nicolas Beldiceanu Irit Katriel Xavier Lorca Annals of Operations Research 171(1): 127--147.
• Inductive Characterizations of Finite Interval Orders and Semiorders (2009). [hal] [doi]
  Jimmy Leblet Jean-Xavier Rampon Order 26(3): 277-281.
• A Priori Error Analysis and Spring Arithmetic (2009). [hal] [paper]
  Gilles Chabert Luc Jaulin SIAM Journal of Scientific Computing 31(3): 2214-2230.
• Making Bound Consistency as Effective as Arc Consistency (2009). [hal] [paper]
  Christian Bessière Thierry Petit Bruno Zanuttini 21th International Joint Conference on Artificial Intelligence (IJCAI'09),
• 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.
• Hull Consistency Under Monotonicity (2009). [hal] [paper]
  Gilles Chabert Luc Jaulin 15th International Conference on Principles and Practice of Constraint Programming (CP'09), Lecture Notes in Computer Science 5732: 188-195.
• 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.
• 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.
• Lazy Composition of Representations in Java (2009). [hal] [paper]
  Rémi Douence Xavier Lorca Nicolas Loriant 8th International Conference on Software Composition (SC'09), Lecture Notes in Computer Science
• Interval Constraints (2009). [hal] [doi]
  Frédéric Benhamou In Encyclopedia of Optimization, pp. 1733-1736. Springer,
• Light Algorithms for Maintaining Max-RPC During Search (2009). [hal] [url]
  Julien Vion Romuald Debruyne 8th Symposium on Abstraction, Reformulation and Approximation (SARA'09),
• 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.
• 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.
• A generic scheme for integrating strong consistencies into constraint solvers (2009). [hal] [paper]
  Julien Vion Thierry Petit Narendra Jussien 14th ERCIM International Workshop on Constraint Solving and Constraint Logic Programming (CSCLP'09),
• Consistance duale et réseaux non-binaires (2009). [hal] [paper]
  Julien Vion 5èmes Journées Francophones de Programmation par Contraintes (JFPC'09), Orléans, France. pp. 325--334.
• Un schéma générique pour intégrer des consistances fortes dans les solveurs de contraintes (2009). [hal] [paper]
  Julien Vion Thierry Petit Narendra Jussien 5èmes Journées Francophones de Programmation par Contraintes (JFPC'09), Orléans, France. pp. 315--324.
• Des contraintes globales prêtes à brancher (2009). [hal] [paper]
  Guillaume Richaud Xavier Lorca Narendra Jussien 5èmes Journées Francophones de Programmation par Contraintes (JFPC'09), Orléans, France. pp. 115--124.
• 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.
• Outillage logiciel pour les problèmes dynamiques (2009). [hal]
  Guillaume Richaud PhD Thesis, Université de Nantes.
• 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.
• The Ordered Global Cardinality Constraint (2009). [paper]
  Thierry Petit Jean-Charles Régin Technical report 09-07-INFO, École des Mines de Nantes.
• The Soft Cumulative Constraint (2009). [paper]
  Thierry Petit Emmanuel Poder Technical report 09-06-INFO, École des Mines de Nantes.
• Light Algorithms for Maintaining Max-RPC During Search (2009). [paper]
  Julien Vion Romuald Debruyne Technical report 09-05-INFO, École des Mines de Nantes.
• Dual Consistency and Non-binary Constraints (2009). [paper]
  Julien Vion Technical report 09-04-INFO, École des Mines de Nantes.
• 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.
• On the Clique Partition of Rectangle Graphs (2009). [paper]
  Gilles Chabert Xavier Lorca Technical report 09-03-INFO, École des Mines de Nantes.
• Toward Plug & Solve Global Constraints (2009).
  Guillaume Richaud Xavier Lorca Narendra Jussien Technical report 09-02-INFO, École des Mines de Nantes.
• Integrating Strong Local Consistencies into Constraint Solvers (2009). [paper]
  Julien Vion Thierry Petit Narendra Jussien Technical report 09-01-INFO, École des Mines de Nantes.
• 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.

2008

• Combining tree Partitioning, Precedence, and Incomparability Constraints (2008). [hal] [doi] [paper]
  Nicolas Beldiceanu Pierre Flener Xavier Lorca Constraints 13(4): 459--489.
• Theoretical Analysis of Singleton Arc Consistency and Its Extensions (2008). [hal] [doi] [paper]
  Christian Bessière Romuald Debruyne Artificial Intelligence 172(1): 29-41.
• 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 Branch and Bound Algorithm for Numerical MAX-CSP (2008). [hal] [doi] [paper]
  Jean-Marie Normand Alexandre Goldsztejn Marc Christie Frédéric Benhamou 14th International Conference on Principles and Practice of Constraint Programming (CP'08), Sydney, Australia. Lecture Notes in Computer Science 5202: 205--219.
• 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.
• Global propagation of practicability constraints (2008). [hal]
  Thierry Petit 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: 361--366.
• A tabu search method for interval constraints (2008). [hal]
  Charlotte Truchet Marc Christie Jean-Marie Normand 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: 372--376.
• 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.
• 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.
• 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.
• The CHOCO constraint programming solver (2008). [hal] [paper]
  Narendra Jussien Guillaume Rochart Xavier Lorca CPAIOR'08 Workshop on Open-Source Software for Integer and Contraint Programming (OSSICP'08), Paris, France.
• 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.
• 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.
• Un modèle markovien pour GSAT et WalkSAT -- résultats préliminaires (2008). [hal] [paper]
  Charlotte Truchet Damien Noguès Narendra Jussien 4èmes Journées Francophones de Programmation par Contraintes (JFPC'08), Nantes, France. pp. 327--336.
• Réordonnancement de domaines dans les réseaux de contraintes (2008). [hal]
  Christian Bessière Thierry Petit Bruno Zanuttini 4èmes Journées Francophones de Programmation par Contraintes (JFPC'08), Nantes, France. pp. 133--142.
• 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.
• Placement de caméra en environnements virtuels (2008).
  Jean-Marie Normand PhD Thesis, Université de Nantes.
• 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.
• 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.
• Occlusion-free Camera Control (2008). [hal]
  Marc Christie Patrick Olivier Jean-Marie Normand Technical report 6640, 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.
• Programmation par Contraintes (2008). [hal] [url]
  Nicolas Beldiceanu École jeunes chercheurs en programmation.

2007

• Global Constraint Catalog: Past, Present and Future (2007). [hal] [doi]
  Nicolas Beldiceanu Mats Carlsson Sophie Demassey Thierry Petit Constraints 12(1): 21-62.
• 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.
• Trends in Constraint Programming (2007). [hal] [url]
  Frédéric Benhamou Narendra Jussien Barry O'Sullivan ISTE, ISBN 1905209975.
• Special Issue on Global Constraints (2007). [hal] [doi]
  Nicolas Beldiceanu (ed.), Constraints 12 Springer,
• Learning implied global constraints (2007). [hal] [paper]
  Christian Bessière and Rémi Coletta Thierry Petit 20th International Joint Conference on Artificial Intelligence (IJCAI'07), pp. 44--49.
• 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.
• 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.
• 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.
• 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),
• Learning from the past to dynamically improve search (2007). [paper]
  Narendra Jussien International Conference on Learning and Intelligent OptimizatioN (LION II),
• ST-serie decomposition of orders (2007). [hal]
  Jimmy Leblet Jean-Xavier Rampon Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW 2007), Pays-Bas. pp. 89-93.
• A portable and efficient implementation of global constraints: the TREE constraint case (2007). [paper]
  Guillaume Richaud Xavier Lorca Narendra Jussien 7th Colloquium on Implementation of Constraint and LOgic Programming Systems (CICLOPS'07), pp. 44-56.
• 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.
• 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.
• 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.
• 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.
• 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.
• Global propagation of practicability constraints (2007).
  Thierry Petit Emmanuel Poder Technical report 07-02-INFO, École des Mines de Nantes.
• Propagation of practicability criteria (2007).
  Thierry Petit Technical report 07-01-INFO, École des Mines de Nantes.
• 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 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.

2006

• Logique(s), langages formels et complexité pour l'informatique (2006). [hal] [url]
  Narendra Jussien Hermes Science, ISBN 2746213958.
• 12th International Conference on Principles and Practice of Constraint Programming (CP'06) (2006). [hal]
  Proceedings, Frédéric Benhamou (ed.),
• A Cost-Regular based hybrid column generation approach (2006). [hal] [doi] [paper]
  Sophie Demassey Gilles Pesant Louis-Martin Rousseau Constraints 11(4): 315-333.
• Identifying and exploiting problem structures using explanation-based constraint programming (2006). [hal] [doi] [paper]
  Hadrien Cambazard Narendra Jussien Constraints 11(4): 295--313.
• A counting of the minimal realizations of the posets of dimension two (2006). [hal]
  Pierre Ille Jean-Xavier Rampon Ars Combinatoria 78: 157-165.
• Chain Dominated Orders (2006). [hal] [doi]
  Glen-Brug Guenver Jimmy Leblet Jean-Xavier Rampon Order 23(2-3): 109-127.
• 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.
• Sweep synchronisation as a global propagation mechanism (2006). [hal] [doi]
  Nicolas Beldiceanu Mats Carlsson Sven Thiel Computers and Operations Research 33(10): 2835--2851.
• Bounds of parameters for global constraints (2006). [hal] [doi]
  Nicolas Beldiceanu Thierry Petit Guillaume Rochart RAIRO Operations Research 40(4): 327--353.
• Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire (2006). [hal] [doi]
  Hadrien Cambazard Narendra Jussien RAIRO Operations Research 40(4): 381--401.
• Graph-Based Filtering (2006). [hal] [doi]
  Nicolas Beldiceanu Mats Carlsson Sophie Demassey Thierry Petit 12th International Conference on Principles and Practice of Constraint Programming (CP'06), Nantes, France. Lecture Notes in Computer Science 4204: 59-74.
• Undirected Forest Constraints (2006). [hal] [paper]
  Nicolas Beldiceanu Irit Katriel Xavier Lorca 3rd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'06), Cork, Ireland. Lecture Notes in Computer Science 3990: 29-43.
• 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.
• Automata for Nogood recording in Constraint satisfaction Problems (2006). [paper]
  Guillaume Richaud Hadrien Cambazard Barry O'Sullivan Narendra Jussien CP'06 Workshop on the Integration of SAT and CP techniques, Nantes, France.
• MultiObjective Optimization and Constraint Programming (2006). [paper]
  Narendra Jussien Vincent Barichard 7th International Conference devoted to Multi-Objective Programming and Goal Programming (MOPGP'06), Vallée de la Loire, France.
• 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.
• 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.
• Calcul d'approximation intérieure pour la résolution de CSPs numériques (2006). [hal]
  Marc Christie Jean-Marie Normand Charlotte Truchet 2èmes Journées Francophones de Programmation par Contraintes (JFPC'06), Nîmes, France.
• Filtrage basé sur des propriétés de graphes (2006). [hal]
  Nicolas Beldiceanu Mats Carlsson Sophie Demassey Thierry Petit 2èmes Journées Francophones de Programmation par Contraintes (JFPC'06), Nîmes, France.
• Contraintes de Partitionnement par des Arbres (2006). [hal] [paper]
  Nicolas Beldiceanu Irit Katriel Xavier Lorca 2èmes Journées Francophones de Programmation par Contraintes (JFPC'06), Nîmes, France. pp. 43-53.
• 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.
• É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.
• 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.
• Suppression de symétries pour les méthodes rétro-prospectives (2006). [hal] [paper]
  Guillaume Richaud Hadrien Cambazard Narendra Jussien 2èmes Journées Francophones de Programmation par Contraintes (JFPC'06), Nîmes, France. pp. 295-304.
• 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.
• 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.
• 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.
• 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.
• Graph-Properties Based Filtering (2006). [paper]
  Nicolas Beldiceanu Mats Carlsson Sophie Demassey Thierry Petit Technical report T2006-10, Swedish Institute of Computer Science.
• 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.
• Global Constraints: Introduction and Graph-Based Representation (2006). [hal] [slides]
  Nicolas Beldiceanu Second International Summer School of the Association for Constraint Programming.
• Experiments with Resolution Search (2006). [hal] [url]
  Sophie Demassey Workshop on Hybrid methods and branching rules in combinatorial optimization. Invited by V. Chvàtal.
• 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.

2005

• Reformulation of Global Constraints Based on Constraint Checkers (2005). [doi]
  Nicolas Beldiceanu Mats Carlsson Romuald Debruyne Thierry Petit Constraints 10(4): 339--362.
• Constraint solving in uncertain and dynamic environments -- a survey (2005). [hal] [doi]
  Gérard Verfaillie Narendra Jussien Constraints 10(3): 253--281.
• What is reconstruction for ordered sets? (2005). [doi]
  Jean-Xavier Rampon Discrete Mathematics 291(1-3): 191-233.
• Filtering Algorithms for the Same and UsedBy Constraints (2005).
  Nicolas Beldiceanu Irit Katriel Sven Thiel Archives of Control Sciences Special issue on Constraint Programming for Decision and Control
• Graph Invariants as Necessary Conditions for Global Constraints (2005).
  Nicolas Beldiceanu Mats Carlsson Jean-Xavier Rampon Charlotte Truchet 11th International Conference on Principles and Practice of Constraint Programming (CP'05), Sitges, Spain. Lecture Notes in Computer Science 3709: 92-106.
• Bounds of Graph Properties (2005). [hal]
  Nicolas Beldiceanu Thierry Petit Guillaume Rochart 11th International Conference on Principles and Practice of Constraint Programming (CP'05), Sitges, Spain. Lecture Notes in Computer Science 3709: 742-746.
• Acquiring Parameters of Implied Global Constraints (2005).
  Christian Bessière Rémi Coletta Thierry Petit 11th International Conference on Principles and Practice of Constraint Programming (CP'05), Sitges, Spain. Lecture Notes in Computer Science 3709: 747-751.
• Integrating Benders decomposition within Constraint Programming (2005). [paper]
  Hadrien Cambazard Narendra Jussien 11th International Conference on Principles and Practice of Constraint Programming (CP'05), Sitges, Spain. Lecture Notes in Computer Science 3709: 752-756.
• The Tree Constraint (2005). [hal] [paper]
  Nicolas Beldiceanu Pierre Flener Xavier Lorca 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'05), Prague, Czech Republic. Lecture Notes in Computer Science 3524: 64-78.
• Identifying and exploiting problem structures using explanation-based constraint programming (2005). [paper]
  Hadrien Cambazard Narendra Jussien 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'05), Prague, Czech Republic. Lecture Notes in Computer Science 3524: 94-109.
• Optimal and Suboptimal Singleton Arc Consistency Algorithms (2005). [paper]
  Christian Bessière Romuald Debruyne 19th International Joint Conference on Artificial Intelligence (IJCAI'05), Edinburgh, Scotland. pp. 54-59.
• 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,
• Faithful extensions on finite orders classes (2005).
  Alain Guillet Jimmy Leblet Jean-Xavier Rampon Electronic Notes in Discrete Mathematics : special issue (ICGT'05) 22: 383-386.
• A musical overconstrained CSP and its cost-functions issues (2005).
  Charlotte Truchet Conference of the International Federation of Operational Research Societies (IFORS'05),
• 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,
• Special Issue on Constraint Programming (2005).
  Philippe Baptiste and Narendra Jussien and Pierre Lopez (ed.), RAIRO Operations Research EDP Science, ISSN 0399 0559, Special issue from a selection of papers presented in the OR/CP research group.
• gcc-like Restrictions on the Same Constraint (2005).
  Nicolas Beldiceanu Irit Katriel Sven Thiel Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming (CSCLP'04), Lecture Notes in Computer Science 3419: 1-11.
• Tearing Customers Apart for solving PSP-SOS (2005).
  Charlotte Truchet Jérémie Bourdon Philippe Codognet IJCAI'05 Constraint Modelling Challenge Entry, Edinburgh, Great Britain.
• Benders decomposition in Constraint Programming (2005).
  Hadrien Cambazard Narendra Jussien Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming (CSCLP'05), Uppsala, Sweden.
• 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.
• 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.
• Constraint Programming for Software Engineering (2005). [paper]
  Narendra Jussien 5th Congress of Logic applied to Technology (LAPTEC'05), Himeji, Japan.
• Explanation-based constraint programming (2005).
  Narendra Jussien 2nd Franco-Japanese Workshop on Constraint Programming (FJCP'05), Le Croisic, France.
• Explications pratiques pour la programmation par contraintes (2005).
  Guillaume Rochart PhD Thesis, Université de Nantes.
• Morphologie des ensembles ordonnés : Répercussions algorithmiques (2005).
  Jimmy Leblet PhD Thesis, Université de Nantes.
• Implémenter des contraintes globales expliquées (2005). [hal] [paper]
  Guillaume Rochart Narendra Jussien 1ères Journées Francophones de Programmation par Contraintes (JFPC'05), Lens, France. pp. 393-402.
• Algorithmes Optimaux et Sous-optimaux de Singleton Consistance d'Arc (2005). [hal]
  Christian Bessière Romuald Debruyne 1ères Journées Francophones de Programmation par Contraintes (JFPC'05), Lens, France. pp. 277-286.
• Bornes de Caractéristiques de Graphes (2005). [hal]
  Nicolas Beldiceanu Thierry Petit Guillaume Rochart 1ères Journées Francophones de Programmation par Contraintes (JFPC'05), Lens, France.
• Des explications pour reconnaître et exploiter les structures cachées (2005). [hal] [paper]
  Hadrien Cambazard Narendra Jussien 1ères Journées Francophones de Programmation par Contraintes (JFPC'05), Lens, France. pp. 403-412.
• Apprentissage de Contraintes Globales Implicites (2005). [hal]
  Christian Bessière Rémi Coletta Thierry Petit 1ères Journées Francophones de Programmation par Contraintes (JFPC'05), Lens, France. pp. 249-258.
• 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.
• Global Constraint Catalog (2005). [paper]
  Nicolas Beldiceanu Mats Carlsson Jean-Xavier Rampon Technical report T2005-08, Swedish Institute of Computer Science.
• Graph Invariants as Necessary Conditions for Global Constraints (2005). [paper]
  Nicolas Beldiceanu Mats Carlsson Jean-Xavier Rampon Charlotte Truchet Technical report T2005-07, Swedish Institute of Computer Science.
• Bounds of Graph Properties (2005).
  Nicolas Beldiceanu Thierry Petit Guillaume Rochart Technical report 05-02-INFO, École des Mines de Nantes.
• Graph-Based Filtering (2005). [slides]
  Nicolas Beldiceanu Applied Mathematics Seminar, Budapest University of Technology.
• Programmation par contraintes avec explications: études et perspectives (2005).
  Narendra Jussien Séminaire 68NQRT de l'IRISA.
• Programmation par contraintes avec explications: études et perspectives (2005).
  Narendra Jussien Séminaire du Laboratoire d'Informatique et de Micro-électronique de Montpellier.
• Explanation-based constraint programming (2005).
  Narendra Jussien Cork Constraint Computation Center seminar.

2004

• 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.
• Solving Musical Constraints with Adaptive Search (2004).
  Charlotte Truchet Philippe Codognet Soft Computing 8(9): 633-640.
• Split orders. (2004). [doi]
  Glen-Brug Guenver Jean-Xavier Rampon Discrete Mathematics 276(1-3): 249-267.
• Une contrainte stretch expliquée (2004). [hal] [paper]
  Guillaume Rochart Narendra Jussien Journal Électronique d'Intelligence Artificielle 3(31)
• Un CSP comme comportement d'agent. Application à la résolution d'équations en physique des milieux granulaires (2004). [hal] [paper]
  Laurent Breton Narendra Jussien Journal Électronique d'Intelligence Artificielle 3(26)
• 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.
• Deriving Filtering Algorithms from Constraint Checkers (2004). [slides]
  Nicolas Beldiceanu Mats Carlsson Thierry Petit 10th International Conference on Principles and Practice of Constraint Programming (CP'04), Lecture Notes in Computer Science 3258: 107-122.
• Cost Evaluation of Soft Global Constraints (2004).
  Nicolas Beldiceanu Thierry Petit 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'04), Nice, France. Lecture Notes in Computer Science 3011: 80-95.
• Filtering Algorithms for the Same (2004).
  Nicolas Beldiceanu Irit Katriel Sven Thiel 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR'04), Nice, France. Lecture Notes in Computer Science 3011: 65-79.
• The Period Constraint (2004). [slides]
  Nicolas Beldiceanu Emmanuel Poder International Conference on Logic Programming (ICLP'04), Lecture Notes in Computer Science
• From Constraints to Finite Automata to Filtering Algorithms (2004). [paper]
  Mats Carlsson Nicolas Beldiceanu European Symposium on Programming (ESOP'04), Lecture Notes in Computer Science 2986: 94-108.
• 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.
• Multiplex dispensation order generation for pyrosequencing (2004). [paper]
  Mats Carlsson Nicolas Beldiceanu CP'04 Workshop on CSP Techniques with Immediate Application,
• Optimal and Suboptimal Singleton Arc Consistency Algorithms (2004). [paper]
  Christian Bessière Romuald Debruyne CP'04 Workshop on Constraint Propagation and Implementation, Toronto, Canada.
• Theoretical Analysis of Singleton Arc Consistency (2004). [paper]
  Christian Bessière Romuald Debruyne ECAI'04 Workshop on Modelling and Solving Problems with Constraints, Valencia, Spain. pp. 20-29.
• Implementing explained global constraints (2004). [paper]
  Étienne Gaudin Narendra Jussien Guillaume Rochart CP'04 Workshop on Constraint Propagation and Implementation (CPAI'04), Toronto, Canada. pp. 61-76.
• MINLP Problems and Explanation-based Constraint Programming (2004). [paper]
  Guillaume Rochart Eric Monfroy Narendra Jussien CP'04 4th Workshop on Cooperative Solvers in Constraint Programming (COSOLV'04), Toronto, Canada.
• 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.
• VISEXP: visualizing constraint solver dynamics using explanations (2004). [paper]
  Mohammad Ghoniem Narendra Jussien Jean-Daniel Fekete 17th International Florida Artificial Intelligence Research Society Conference (FLAIRS'04), Miami, Florida, USA.
• Dispensation order generation for pyrosequencing (2004).
  Mats Carlsson Nicolas Beldiceanu 2nd Asia Pacific Bioinformatics Conference, vol. 29.
• Conception d'une contrainte globale de chemin (2004). [url]
  Hadrien Cambazard Eric Bourreau 10èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'04), Angers, France. pp. 107-121.
• 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.
• Contraintes de flot et explications (2004). [paper]
  Guillaume Rochart Narendra Jussien 10èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'04), Angers, France. pp. 369-372.
• La contrainte Periode (2004).
  Nicolas Beldiceanu Emmanuel Poder 13èmes Journées Francophones de Programmation en Logique et avec Contraintes (JFPLC'04), Angers, France.
• Hybrid Optimization Techniques (2004).
  Narendra Jussien and François Laburthe (ed.), Annals of Operations Research 130 Kluwer, ISSN 0254 5330, Special Issue following CPAIOR'02.
• 10èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'04) (2004). [url]
  Proceedings, Narendra Jussien (ed.), Angers, France.
• Modélisation et optimisation d'un problème de tournées de véhicules avec gestion de stocks (2004).
  Émilie Grellier Pierre Dejax Yazid Mati Technical report 04-6-AUTO, École des Mines de Nantes.
• Decomposition and learning for a hard real time task allocation problem (2004). [paper]
  Hadrien Cambazard Pierre-Emmanuel Hladik Anne-Marie Déplanche Narendra Jussien Yvon Trinquet Technical report 04-04-INFO, École des Mines de Nantes.
• Explained global constraints at work (2004). [paper]
  Étienne Gaudin Narendra Jussien Guillaume Rochart Technical report 04-03-INFO, École des Mines de Nantes.
• Filtering Algorithms for the Same and UsedBy Constraints (2004). [url]
  Nicolas Beldiceanu Irit Katriel Sven Thiel Technical report MPI-I-2004-001, MPI.
• Deriving Filtering Algorithms from Constraint Checkers (2004). [paper]
  Nicolas Beldiceanu Mats Carlsson Thierry Petit Technical report T2004-08, Swedish Institute of Computer Science.
• Dynamic constraint solving (2004).
  Narendra Jussien Séminaire du National Institute for Informatics (Tokyo, Japan).

2003

• Loading aircraft for military operations (2003). [hal] [paper]
  Christelle Guéret Narendra Jussien Olivier Lhomme Claire Pavageau Christian Prins Journal of the Operational Research Society 54(5): 458-465.
• 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,
• Dynamic constraint solving (2003). [url]
  Gérard Verfaillie Narendra Jussien 9th International Conference on Principles and Practice of Constraint Programming (CP'03), Kinsale, County Cork, Ireland.
• 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.
• On-Line Resources Allocation for ATM Networks with Rerouting (2003).
  Samir Loudni Patrice Boizumault Philippe David 5th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Problems (CPAIOR'03), Montréal, Canada. pp. 51 - 65.
• Combining Constraint Programming and Local Search to Design New Powerful Heuristics (2003). [paper]
  Narendra Jussien Olivier Lhomme 5th Metaheuristics International Conference (MIC'03), Kyoto, Japan.
• Correctness of Constraint Retraction Algorithms (2003). [hal] [paper]
  Romuald Debruyne Gérard Ferrand Narendra Jussien Willy Lesaint Samir Ouis Alexandre Tessier 16th International Florida Artificial Intelligence Research Society Conference (FLAIRS'03), St. Augustine, Florida, USA. pp. 172-176.
• k-relevant explanations for constraint programming (2003). [paper]
  Samir Ouis Narendra Jussien Patrice Boizumault 16th International Florida Artificial Intelligence Research Society Conference (FLAIRS'03), St. Augustine, Florida, USA. pp. 192-196.
• A General Conflict-Set Based Framework for Partial Constraint Satisfaction (2003). [paper]
  Thierry Petit Christian Bessière Jean-Charles Régin CP'03 5th Workshop on Soft Constraints (Soft'03), Kinsale, Ireland.
• Challenging explanations for global constraints (2003). [paper]
  Guillaume Rochart Narendra Jussien Fran\c{c}ois Laburthe CP'03 Workshop on User-Interaction in Constraint Satisfaction (UICS'03), Kinsale, Ireland. pp. 31-43.
• Visualizing explanations to exhibit dynamic structure in constraint problems (2003). [paper]
  Mohammad Ghoniem Narendra Jussien Jean-Daniel Fekete CP'03 Workshop on User-Interaction in Constraint Satisfaction (UICS'03), Kinsale, Ireland. pp. 1-15.
• Solving dynamic RCPSP using explanations-based constraint programming (2003). [hal] [paper]
  Abdallah Elkhyari Christelle Guéret Narendra Jussien 6th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP'03), Aussois, France. pp. 119-120.
• Generic filtering algorithms for generic global constraints (2003).
  Nicolas Beldiceanu Joint Annual Workshop of the ERCIM Working Group on Constraints and the CoLogNET area on Constraint and Logic Programming, Budapest, Hungary.
• Un CSP comme comportement d'agent. Application à la résolution d'équations en physique des milieux granulaires (2003). [paper]
  Laurent Breton Narendra Jussien 9èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'03), Amiens, France. pp. 99-113.
• Détection de Conflits pour la Résolution de Problèmes Sur-Contraints (2003). [paper]
  Thierry Petit Christian Bessière Jean-Charles Régin 9èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'03), Amiens, France. pp. 293-307.
• Une contrainte stretch expliquée (2003). [paper]
  Guillaume Rochart Narendra Jussien 9èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'03), Amiens, France. pp. 309-323.
• L'enseignement de la programmation logique à l'École des Mines de Nantes (2003). [paper]
  Narendra Jussien 12èmes Journées Francophones de Programmation en Logique et avec Contraintes (JFPLC'03), Amiens, France. pp. 63-75.
• Explications k-relevantes pour la programmation par contraintes (2003). [paper]
  Samir Ouis Narendra Jussien Patrice Boizumault 12èmes Journées Francophones de Programmation en Logique et avec Contraintes (JFPLC'03), Amiens, France. pp. 111-124.
• Réservation en ligne avec reroutage de demandes de connexions dans les réseaux ATM (2003).
  Samir Loudni Patrice Boizumault Philippe David 12èmes Journées Francophones de Programmation en Logique et avec Contraintes (JFPLC'03), Amiens, France. pp. 169 - 182.
• Coopération d'algorithmes de Recherche Locale : Application à la résolution du problème de construction d'emploi du temps (2003).
  Mohamed Tounsi Philippe David 5ème congrès de la société française de recherche opérationnelle et d'aide à la décision (ROADEF'03), Avignon, France.
• Utilisation de la programmation par contraintes pour résoudre le RCPSP dynamique et quelques extensions (2003).
  Abdallah Elkhyari Christelle Guéret Narendra Jussien 5ème congrès de la Société Fran\c{c}aise de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'03), Avignon, France. pp. 97-98.
• Programmation par contraintes pour les technologies logicielles (2003). [paper]
  Narendra Jussien Colloque l'industrie du logiciel -- outils et méthodologies (GEMSTIC'03), Paris, France.
• Outils d'aide à la décision pour des problèmes d'ordonnancement dynamiques (2003).
  Abdallah Elkhyari PhD Thesis, Université de Nantes.
• Outils de mise au point pour la programmation par contraintes (2003).
  Samir Ouis PhD Thesis, Université de Nantes.
• The versatility of using explanations within constraint programming (2003). [hal]
  Narendra Jussien Habilitation thesis of Université de Nantes.
• Contraintes Globales: Aspects Algorithmiques et Déclaratifs (2003). [slides]
  Nicolas Beldiceanu Habilitation thesis of Université Paris 6.
• Explanation-based repair techniques for constraint programming (2003). [paper]
  Narendra Jussien Romuald Debruyne Technical report D3.2.3, Projet OADymPPaC.
• The versatility of using explanations within constraint programming (2003). [paper]
  Narendra Jussien Technical report 03-04-INFO, École des Mines de Nantes.
• Explanations for global constraints: instrumenting the stretch constraint (2003). [paper]
  Guillaume Rochart Narendra Jussien Technical report 03-01-INFO, École des Mines de Nantes.

2002

• Local search with constraint propagation and conflict-based heuristics (2002). [hal] [paper]
  Narendra Jussien Olivier Lhomme Artificial Intelligence 139(1): 21-45.
• Reconstruction of Finite Truncated Semi-Modular Lattices. (2002). [doi]
  Jean-Xavier Rampon Bernd S. W. Schröder J. Comb. Theory, Ser. B 86(2): 254-272.
• Successive Search Methods for Solving Constraint and Optimization Problems (2002).
  Mohamed Tounsi Philippe David International Journal of Artificial Intelligence Tools 11(3)
• Connections Reservation with Rerouting for ATM Networks : A Hybrid Approach with Constraints (2002).
  Muriel Lauvergne Philippe David Patrice Boizumault 8th International Conference on Principles and Practice of Constraint Programming (CP'02), Ithaca, NY, USA. Lecture Notes in Computer Science 2470: 649 - 663.
• Range-based Algorithm for Max-CSP (2002). [url]
  Thierry Petit Jean-Charles Régin Christian Bessière 8th International Conference on Principles and Practice of Constraint Programming (CP'02), Ithaca, NY, USA. Lecture Notes in Computer Science 2470: 280-294.
• 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.
• Local search algorithms to improve local search (2002).
  Mohamed Tounsi Philippe David 14th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'02), Washington DC, USA. pp. 438.
• 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.
• 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.
• Range-based Algorithm for Max-CSP (2002). [url]
  Thierry Petit Jean-Charles Régin Christian Bessière ECAI'02 Workshop on Modelling and Solving Problems with Constraints, Lyon, France.
• Tracing and explaining execution of CLP(FD) programs (2002).
  Magnus \rAgren Tamas Szeredi Nicolas Beldiceanu Mats Carlsson ICLP'02 12th Workshop on Logic Programming Environments (WLPE'02), Copenhaguen, Denmark.
• COINS: a constraint-based interactive solving system (2002). [hal] [paper]
  Samir Ouis Narendra Jussien Patrice Boizumault ICLP'02 12th Workshop on Logic Programming Environments (WLPE'02), Copenhaguen, Denmark. pp. 31 - 46.
• Towards a New Local Search Algorithms Cooperation: An application to Solve Examination Timetabling Problems (2002).
  Mohamed Tounsi Philippe David CP'02 2nd Workshop on Cooperative Solvers in Constraint Programming (COSOLV'02), Ithaca, USA.
• A repair based approach for planning connection demands in ATM networks (2002).
  Samir Loudni Patrice Boizumault Philippe David CP'02 4th Workshop on Soft Constraints (Soft'02), Ithaca, NY.
• k-relevant explanations for constraint programming (2002). [paper]
  Samir Ouis Narendra Jussien Patrice Boizumault CP'02 Workshop on User-Interaction in Constraint Satisfaction (UICS'02), Ithaca, NY, USA. pp. 109-123.
• Non-intrusive constraint solver enhancements (2002). [paper]
  Rémi Douence Narendra Jussien 1st AOSD Workshop on Aspects, Components, and Patterns for Infrastructure Software (ACP4IS), Enschede, The Netherlands.
• Non-intrusive constraint solver enhancements (2002). [paper]
  Rémi Douence Narendra Jussien Colloquium on Implementation of Constraint and LOgic Programming Systems (CICLOPS'02), CW Reports 344: 26-36.
• Explanation-based repair techniques for solving dynamic scheduling problems (2002). [paper]
  Abdallah Elkhyari Christelle Guéret Narendra Jussien Workshop on On-line Planning and Scheduling (AIPS'02), Toulouse, France.
• Vers une unification des algorithmes de résolution de CSP (2002). [paper]
  Narendra Jussien Olivier Lhomme 8èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'02), Nice, France. pp. 155-168.
• Explications conviviales pour la programmation par contraintes (2002). [paper]
  Samir Ouis Narendra Jussien Olivier Lhomme 11èmes Journées Francophones de Programmation en Logique et avec Contraintes (JFPLC'02), Nice, France. pp. 105-118.
• Representation of soft constraints by hard constraints (2002). [url]
  Jean-Charles Régin Jean-François Puget Thierry Petit 11èmes Journées Francophones de Programmation en Logique et avec Contraintes (JFPLC'02), Nice, France.
• Modélisation et algorithmes de résolution des problèmes sur-contraints (2002). [paper]
  Thierry Petit PhD Thesis, LIRMM-Université de Montpellier II.
• 4th international workshop on integration of AI and OR techniques in Constraint Programming for combinatorial optimisation problems (CPAIOR'02) (2002).
  Proceedings, Narendra Jussien and François Laburthe (ed.), Le Croisic, France.
• Non-intrusive constraint solver enhancements (2002). [paper]
  Rémi Douence Narendra Jussien Technical report 02-2-INFO, École des Mines de Nantes.
• Conflict-based repair techniques for solving dynamic scheduling problems (2002). [paper]
  Abdallah Elkhyari Christelle Guéret Narendra Jussien Technical report 02-5-INFO, École des Mines de Nantes.
• 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 Technical report 02-7-INFO, École des Mines de Nantes.
• 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.
• Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint (2002). [paper]
  Nicolas Beldiceanu Mats Carlsson Sven Thiel Technical report T2002-14, Swedish Institute of Computer Science.
• Débogage dynamique de programmes avec contraintes sur les domaines finis: état et perspectives (2002). [url]
  Pierre Deransart François Fages Narendra Jussien Ludovic Langevine Raphaël Martin Technical report D2.1.1.1, Projet OADymPPaC.
• Unifying search algorithms for CSP (2002). [paper]
  Narendra Jussien Olivier Lhomme Technical report 02-3-INFO, École des Mines de Nantes.
• Correctness of Constraint Retraction Algorithms (2002). [paper]
  Romuald Debruyne Gérard Ferrand Narendra Jussien Willy Lesaint Samir Ouis Alexandre Tessier Technical report 02-6-INFO, École des Mines de Nantes.
• Correctness of Constraint Retraction Algorithms (2002). [url]
  Romuald Debruyne Gérard Ferrand Narendra Jussien Willy Lesaint Samir Ouis Alexandre Tessier Technical report 2002-09, Laboratoire d'Informatique Fondamentale d'Orléans.
• Global Constraints (2002). [slides]
  Nicolas Beldiceanu Tutorial at CP'2002, Principles and Practice of Constraint Programming.

2001

• Domain Filtering Consistencies (2001). [paper]
  Romuald Debruyne Christian Bessière Journal of Artificial Intelligence Research 14: 205-230.
• Resource allocation in a mobile telephone network: a constructive repair algorithm (2001).
  Patrice Boizumault Philippe David Housni Djellab RAIRO Operations Research 35: 189-209.
• 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.
• Pruning for the minimum Constraint Family and for the number of distinct values Constraint Family (2001). [url] [slides]
  Nicolas Beldiceanu 7th International Conference on Principles and Practice of Constraint Programming (CP'01), Paphos, Cyprus. Lecture Notes in Computer Science 2239: 211-224.
• Specific Filtering Algorithms for Over-Constrained Problems (2001). [url]
  Thierry Petit Jean-Charles Régin Christian Bessière 7th International Conference on Principles and Practice of Constraint Programming (CP'01), Paphos, Cyprus. Lecture Notes in Computer Science 2239: 451-464.
• New Lower Bounds of Constraint Violations for Over-Constrained Problems (2001). [url]
  Jean-Charles Régin Thierry Petit Christian Bessière Jean-François Puget 7th International Conference on Principles and Practice of Constraint Programming (CP'01), Paphos, Cyprus. Lecture Notes in Computer Science 2239: 332-345.
• Revisiting the cardinality Operator and Introducing the cardinality-path Constraint Family (2001). [url] [slides]
  Nicolas Beldiceanu Mats Carlsson International Conference on Logic Programming (ICLP'01), Paphos, Cyprus. Lecture Notes in Computer Science 2237: 59-73.
• Successive Search Method for Valued Constraint Satisfaction and Optimization Problems (2001).
  Mohamed Tounsi Philippe David 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'01), Dallas, USA.
• Resource Allocation in ATM Networks: A Hybrid Approach (2001).
  Muriel Lauvergne Philippe David Patrice Boizumault 3rd International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Problems (CPAIOR'01), Ashford, UK. pp. 51 - 65.
• 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.
• Visual and Adaptive Constraint Programming in Music (2001).
  Charlotte Truchet Gérard Assayag Philippe Codognet (ICMC'01),
• 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.
• e-constraints: explanation-based Constraint Programming (2001). [paper]
  Narendra Jussien CP'01 Workshop on User-Interaction in Constraint Satisfaction, Paphos, Cyprus.
• 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.
• User-friendly explanations for constraint programming (2001). [paper]
  Narendra Jussien Samir Ouis ICLP'01 11th Workshop on Logic Programming Environments (WLPE'01), Paphos, Cyprus.
• Algorithmes de filtrage specifiques pour les problemes sur-contraints (2001). [url]
  Thierry Petit Jean-Charles Régin Christian Bessière 7èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'01), Toulouse, France.
• Allocation de ressources en réseaux ATM: une approche hybride (2001).
  Muriel Lauvergne Philippe David Patrice Boizumault 7èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'01), Toulouse, France.
• Quelques explications pour les patrons ou une utilisation de la PPC avec explications pour l'identification de patrons de conception (2001). [paper]
  Yann-Ga\"{e}l Guéhéneuc Narendra Jussien 7èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'01), Toulouse, France. pp. 111-122.
• Programmation par contraintes avec explications (2001). [paper]
  Narendra Jussien 7èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'01), Toulouse, France. pp. 147-158.
• Generalization of constructive disjunction for over-constrained problems (2001). [url]
  Thierry Petit Jean-Charles Régin Christian Bessière INFORMS International Meeting, Miami, USA.
• Recherche locale et propagation de contraintes pour résoudre les problèmes d'Open-Shop (2001). [paper]
  Narendra Jussien 3èmes journées francophones de Recherche Opérationnelle (Francoro III/Roadef 2001), Québec, Canada.
• Problèmes sur-contraints (2001).
  Thierry Petit Journées Franciliennes de Recherche Opérationnelle (JFRO'01), Paris.
• Problèmes sur-contraints (2001). [url]
  Thierry Petit Journees des doctorants de l'école I2S, Montpellier. pp. 96-99.
• Proposition de format concret pour les traces générées par les solveurs de contraintes (2001). [paper]
  Romuald Debruyne Jean-Daniel Fekete Narendra Jussien Mohammad Ghoniem others Technical report D2.2.2.1, Projet OADymPPaC.
• Loading aircrafts for military operations (2001). [paper]
  Christelle Guéret Narendra Jussien Olivier Lhomme Claire Pavageau Christian Prins Technical report 01-2-INFO, École des Mines de Nantes.
• Programmation par Contraintes avec Explications (2001). [paper]
  Narendra Jussien Journée Contraintes et Règles de l'Association Française pour la Programmation Logique et la programmation par Contraintes. Invité par Arnaud Lallouet et Gérard Ferrand.
• e-constraints: explanation-based Constraint Programming (2001).
  Narendra Jussien Technical report 01-5-INFO, École des Mines de Nantes.
• User-friendly explanations for constraint programming (2001).
  Narendra Jussien Samir Ouis Technical report 01-6-INFO, École des Mines de Nantes.
• Constructive cardinality (2001). [url]
  Nicolas Beldiceanu Mats Carlsson Technical report T2001-15, Swedish Institute of Computer Science.

2000

• 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,
• 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.
• Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type (2000). [url]
  Nicolas Beldiceanu 6th International Conference on Principles and Practice of Constraint Programming (CP'00), Singapore. Lecture Notes in Computer Science 1894: 52-66.
• An original constraint based approach for solving over constrained problems (2000). [url]
  Jean-Charles Régin Thierry Petit Christian Bessière Jean-François Puget 6th International Conference on Principles and Practice of Constraint Programming (CP'00), Singapore. Lecture Notes in Computer Science 1894: 543-548.
• Maintaining Arc-Consistency within Dynamic Backtracking (2000). [paper]
  Narendra Jussien Romuald Debruyne Patrice Boizumault 6th International Conference on Principles and Practice of Constraint Programming (CP'00), Singapore. Lecture Notes in Computer Science 1894: 249-261.
• A Property of Path Inverse Consistency Leading to an Optimal Algorithm (2000). [paper]
  Romuald Debruyne European Conference on Artificial Intelligence (ECAI'00), Berlin, Germany. pp. 88-92.
• Local search with constraint propagation and conflict-based heuristics (2000). [paper]
  Narendra Jussien Olivier Lhomme 7th National Conference on Artificial Intelligence (AAAI'00), Austin, TX, USA. pp. 169-174.
• Meta-constraints on violations for over-constrained problems (2000). [url]
  Thierry Petit Jean-Charles Régin Christian Bessière 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'00), Vancover, Canada. pp. 358-365.
• The path-repair algorithm (2000). [hal] [doi] [paper]
  Narendra Jussien Olivier Lhomme CP'99 Workshop on Large scale combinatorial optimisation and constraints, Alexandria, VA, USA. Electronic Notes in Discrete Mathematics 4
• Sweep as a generic pruning technique (2000).
  Nicolas Beldiceanu CP'00 Workshop on Techniques foR Implementing Constraint programming (TRICS), Singapore.
• The PaLM system: explanation-based constraint programming (2000). [paper]
  Narendra Jussien Vincent Barichard CP'00 Workshop on Techniques foR Implementing Constraint programming Systems (TRICS), Singapore. pp. 118-133.
• Cumulative constraint for trapezoid resource requirement (2000).
  Emmanuel Poder Nicolas Beldiceanu 17th International Symposium on Mathematical Programming (ISMP'00), Atlanta, USA.
• An original constraint based approach for solving over constrained problems (2000).
  Thierry Petit Jean-Charles Régin 17th International Symposium on Mathematical Programming (ISMP'00), Atlanta, USA.
• Loading aircrafts for military operations (2000). [paper]
  Christelle Guéret Narendra Jussien Olivier Lhomme Claire Pavageau Christian Prins 1st International Workshop on Freight Transportation and Logistics (ODYSSEUS'00), Chania, Crete.
• Maintien de la consistance d'arc dans Dynamic Backtracking (2000). [paper]
  Narendra Jussien Romuald Debruyne Patrice Boizumault 6èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'00), Marseille, France. pp. 135-149.
• Meta-contraintes pour la modélisation de problèmes sur-contraints (2000). [url]
  Thierry Petit 6èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'00), Marseille, France.
• Chargement d'avions dans le cadre d'une projection de forces (2000). [paper]
  Christelle Guéret Narendra Jussien Olivier Lhomme Claire Pavageau Christian Prins 3ème congrès de la Société Fran\c{c}aise de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'00), Nantes, France.
• Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type (2000). [url]
  Nicolas Beldiceanu Technical report T2000-01, Swedish Institute of Computer Science.

1999

• A strong local consistency for constraint satisfaction (1999).
  Romuald Debruyne 11th International Conference on Tools with Artificial Intelligence (ICTAI'99), Chicago, Ill, USA. pp. 202-209.
• 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.
• Improving branch and bound algorithms for Open Shop problems (1999). [paper]
  Narendra Jussien Christelle Guéret Conference of the International Federation of Operational Research Societies (IFORS'99), Beijing, China.
• The path-repair algorithm (1999). [paper]
  Narendra Jussien Olivier Lhomme CP'99 Workshop on Large scale combinatorial optimisation and constraints, Alexandria, VA, USA.
• A repair algorithm for allocating resources in a mobile telephone network (1999).
  Patrice Boizumault Philippe David Housni Djellab (PACLP'99), London, UK. pp. 491-501.
• L'algorithme Path-Repair (1999). [paper]
  Narendra Jussien Olivier Lhomme 5èmes Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'99), Lyon, France.
• Allocation de ressources dans un réseau de téléphonie mobile: une approche à base de contraintes (1999).
  Patrice Boizumault Philippe David Housni Djellab 2ème congrès de la société française de recherche opérationnelle et d'aide à la décision (ROADEF'99), Autrans, France.
• A Note on CSPLIB prob007 (1999). [paper]
  Helmut Simonis Nicolas Beldiceanu Technical report , .
• A Note on Perfect Square Placement (1999). [paper]
  Helmut Simonis, Éric Bourreau et Nicolas Beldiceanu Technical report , .
• Explanations for constraint solvers (1999). [paper]
  Narendra Jussien Séminaire prospectif sur le débogage de contraintes. Invité par Pierre Deransart..
• Explications et Programmation par contraintes (1999). [paper]
  Narendra Jussien Séminaire de l'Equipe LANDE, IRISA (Rennes). Invité par Erwan Jahier.

1998

• Dynamic domain splitting for numeric CSP (1998). [paper]
  Narendra Jussien Olivier Lhomme European Conference on Artificial Intelligence (ECAI'98), Brighton, United Kingdom. pp. 224-228.
• A constraint-based approach for examination timetabling using local repair techniques (1998).
  Philippe David In Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 1408: 169-186. E. K. Burke and M. W. Carter (ed.),
• 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.
• About avoidable computations in Interval methods (1998). [paper]
  Narendra Jussien Olivier Lhomme IMACS/GAMM international symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN'98), Budapest, Hungary. pp. 66.
• Etude des consistances locales pour les problèmes de satisfaction de contraintes de grande taille (1998). [url]
  Romuald Debruyne PhD Thesis, LIRMM-Université de Montpellier II.
• Procédures de Séparation-Évaluation -- Une alternative au retour-arrière -- Application au problème d'Open-Shop (1998). [hal] [paper]
  Narendra Jussien Christelle Guéret 7èmes Journées Francophones de Programmation en Logique et avec Contraintes (JFPLC'98), Nantes, France. pp. 231-250.
• Which local consistency has to used on large constraint networks ? (1998). [paper]
  Romuald Debruyne Christian Bessière Technical report 98-037, LIRMM-Université de Montpellier II.
• Removing more values than max-restricted path consistency for the same cost (1998). [paper]
  Romuald Debruyne Technical report 98-041, LIRMM-Université de Montpellier II.
• Systèmes dynamiques et Relaxation (1998). [paper]
  Narendra Jussien Journée Contraintes dynamiques, réactivité, interactivité de l'Association Française pour la Programmation Logique et la programmation par Contraintes. Invité par Philippe Codognet et Patrice Boizumault.
• Affectation des candidats aux jurys d'admission à l'École des Mines de Nantes (1998).
  Philippe David Séminaire AFPLC, thème ``La Programmation par Contraintes et les Emplois du Temps'', Orsay.

1997

• From restricted path consistency to max-restricted path consistency (1997). [paper]
  Romuald Debruyne Christian Bessière 3rd International Conference on Principles and Practice of Constraint Programming (CP'97), Linz, Austria. pp. 312-326.
• Some Practicable Filtering Techniques for the Constraint Satisfaction Problem (1997). [paper]
  Romuald Debruyne Christian Bessière 15th International Joint Conference on Artificial Intelligence (IJCAI'97), Nagoya, Japan. pp. 412-417.
• A Best First approach for solving over-constrained dynamic problems (1997). [paper]
  Narendra Jussien Patrice Boizumault International Joint Conference on Artificial Intelligence (IJCAI'97), Nagoya, Japan.
• A Constraint-based approach for examination timetabling using local repair techniques (1997).
  Philippe David 2nd International Conference on the Practice And Theory of Automated Timetabling (PATAT'97), Toronto, Canada. pp. 132-145.
• Best-first search for property Maintenance in reactive constraints systems (1997). [paper]
  Narendra Jussien Patrice Boizumault International Logic Programming Symposium, Port Jefferson, N.Y., USA. pp. 339-353.
• Dynamic Backtracking with Constraint Propagation - Application to static and dynamic CSPs (1997). [paper]
  Narendra Jussien Patrice Boizumault CP'97 Workshop on The Theory and Practice of Dynamic Constraint Satisfaction, Schloss Hagenberg, Austria.
• Dynamic Backtracking with Constraint Propagation - Application to numeric CSPs (1997). [paper]
  Narendra Jussien Olivier Lhomme CP'97 Workshop on The Theory and Practice of Dynamic Constraint Satisfaction, Schloss Hagenberg, Austria.
• Stratégies en Meilleur d'abord pour la relaxation de contraintes (1997). [paper]
  Narendra Jussien Patrice Boizumault 6èmes Journées Francophones de Programmation en Logique et avec Contraintes (JFPLC'97), Orléans, France. pp. 149-165.
• Relaxation de Contraintes pour les problèmes dynamiques (1997). [hal] [paper]
  Narendra Jussien PhD Thesis, Université de Rennes I.
• A Best First approach for solving over-constrained dynamic problems (1997). [paper]
  Narendra Jussien Patrice Boizumault Technical report 97-6-INFO, École des Mines de Nantes.
• Stratégies en Meilleur d'abord pour la relaxation de contraintes (1997).
  Narendra Jussien Patrice Boizumault Technical report 97-5-INFO, École des Mines de Nantes.
• A constraint relaxation system: DECorum (1997).
  Narendra Jussien Groupe de travail "Programmation en Logique" de l'AFCET (ALP France). Invité par les acteurs du projet ESPRIT (LTR) DiSCiPl (Debugging systems for Constraint Programming).
• Méthodes de réparation pour l'affectation de jurys d'examen (1997).
  Philippe David Réunion de l'axe ``Algorithmes''(1.2) du Gdr I3, Montpellier.
• Dynamic Backtracking with Constraint Propagation (1997). [paper]
  Narendra Jussien Olivier Lhomme Patrice Boizumault Journée du P\^{o}le Contraintes et Programmation Logique, GDR Programmation du CNRS.
• Contribution à l'étude des systèmes dynamiques de contraintes - résolution de problèmes sur-contraints (1997).
  Narendra Jussien Séminaire du CREAM (Laboratoire de Recherche de l'Institut de Mathématiques Appliquées). Invité par Éric Pinson.

1996

• Arc-consistency in Dynamic CSPs Is No More Prohibitive (1996). [paper]
  Romuald Debruyne 8th International Conference on Tools with Artificial Intelligence (ICTAI'96), Toulouse, France. pp. 239-267.
• 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,
• Implementing Constraint Relaxation over Finite Domains using ATMS (1996). [paper]
  Narendra Jussien Patrice Boizumault In Over-Constrained Systems, Lecture Notes in Computer Science 1106: 265-280. Michael Jampel and Eugene Freuder and Michael Maher (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.
• CSP dynamiques et Relaxation de Contraintes (1996). [paper]
  Narendra Jussien Patrice Boizumault 2ème Conférence Nationale sur la résolution pratique de Problèmes NP-Complets (CNPC'96), Dijon, France. pp. 135-149.
• Maintien de Déduction pour la Relaxation de Contraintes (1996). [paper]
  Narendra Jussien Patrice Boizumault 5èmes Journées Francophones de Programmation en Logique et avec Contraintes (JFPLC'96), Clermont-Ferrand, France. pp. 239-253.
• Maintien de Déduction pour la Relaxation de Contraintes (1996).
  Narendra Jussien Patrice Boizumault Technical report 96-4-INFO, École des Mines de Nantes.
• CSP dynamiques et Relaxation de Contraintes (1996).
  Narendra Jussien Patrice Boizumault Technical report 96-3-INFO, École des Mines de Nantes.
• Relaxation de Contraintes en PLC (1996).
  Narendra Jussien Séminaire du CREAM (Laboratoire de Recherche de l'Institut de Mathématiques Appliquées). Invité par Éric Pinson.
• Une sémantique opérationnelle pour la relaxation de contraintes (1996). [paper]
  Narendra Jussien Patrice Boizumault Journée du P\^{o}le Contraintes et Programmation Logique, GDR Programmation du CNRS.

1995

• Using pivot consistency to decompose and solve functional CSPs (1995).
  Philippe David Journal of Artificial Intelligence Research 2: 447-474.
• Les algorithmes d'arc-consistance dans les CSP dynamiques (1995). [paper]
  Romuald Debruyne Revue d'Intelligence Artificielle 9(3): 239-267.
• Building University timetables using Constraint Logic Programming (1995). [hal] [paper]
  Christelle Guéret Narendra Jussien Patrice Boizumault Christian Prins 1st International Conference on the Practice and Theory of Automated Timetabling (ICPTAT'95), Edinburgh, United Kingdom. pp. 393-408.
• Implementing Constraint Relaxation over Finite Domains using ATMS (1995). [paper]
  Narendra Jussien Patrice Boizumault CP'95 Workshop on Over-Constrained Systems (OCS'95), Cassis, France.
• Autour du problème de satisfaction de contraintes (1995).
  Projet PRC-IA CSP Flexibles (19 membres) Cinquièmes journées nationales PRC-GDR IA.

1994

• Introducing Global Constraints in CHIP (1994). [hal]
  Nicolas Beldiceanu Evelyne Contejean Mathl. Comput. Modelling 20(12): 97-123.
• Consistance de pivot et CSP fonctionnels -- Une consistance partielle pour des solutions globales (1994).
  Philippe David Revue d'Intelligence Artificielle 8(2): 145-185.
• 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
• Le système expert NEREIS des annélides polychètes de France (ordre des Phyllodocida, Amphinomida, Spintherida et Eunicida) (1994). [url]
  Narendra Jussien Vincent Verger Yvon L'Hospitalier Bernard Augereau Patrick Gillet Canadian Journal of Zoology -- Revue Canadienne de Zoologie 72(12): 2255-2260.
• La consistance de pivot, un filtrage efficace pour les CSP fonctionnels (1994).
  Philippe David 9ème Congrès en Reconnaissance des Formes et Intelligence Artificielle (RFIA'94), Paris, France. pp. 421-431.
• Énumération et relaxation en Programmation Logique avec Contraintes (1994).
  Patrice Boizumault Christelle Guéret Narendra Jussien Rencontres sur la résolution pratique des problèmes NP-complets, Montpellier, France.
• Prise en compte de la sémantique dans les problèmes de satisfaction de contraintes : Étude des contraintes fonctionnelles (1994).
  Philippe David PhD Thesis, Université Montpellier II.
• Relaxation de contraintes -- études et perspectives (1994).
  Narendra Jussien Master Thesis, Institut de Mathématiques Appliquées, Angers, France.
• DnAC-6 (1994).
  Romuald Debruyne Technical report 94-054, LIRMM-Université de Montpellier II.

1993

• Extending CHIP in order to Solve Complex Scheduling and Placement Problems (1993). [hal]
  Abderrahmane Aggoun Nicolas Beldiceanu Mathl. Comput. Modelling 17(7): 57-73.
• Overview of the CHIP Compiler System (1993).
  Abderrahmane Aggoun Nicolas Beldiceanu Constraint Logic Programming, Selected Research, pp. 421-435.
• When functional and bijective constraints make a CSP polynomial (1993).
  Philippe David 13th International Joint Conference on Artificial Intelligence (IJCAI'93), Chambéry, France. pp. 224-229.
• Variations en Programmation Logique sous Contraintes (1993).
  Narendra Jussien Master Thesis, Institut de Mathématiques Appliquées, Angers, France.
• Programmation Logique sous Contraintes et Problèmes d'ordonnancements (1993).
  Narendra Jussien Petit séminaire de l'IRISA (Rennes). Invité par Yves Bekkers.

1992

• 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.
• Quelques propriétés des consistances d'arc et de chemin pour deux classes de CSP (1992).
  Philippe David 1ères Rencontres Nationales des Jeunes Chercheurs en I.A., Rennes, France. pp. 232-241.
• NEREIS: un système expert de reconnaissance d'Annélides Polychètes (1992).
  Narendra Jussien Vincent Verger Patrick Gillet Yvon L'Hospitalier Bernard Augereau 4ème Conférence Internationale sur les Annélides Polychètes, Angers, France.
• Quelques propriétés des consistances d'arc et de chemin pour deux classes de CSP (1992).
  Philippe David Technical report 92-007, LIRMM-Université de Montpellier II.
• NEREIS: Système expert de reconnaissance d'Annélides Polychètes (1992).
  Narendra Jussien Vincent Verger Master Thesis, Institut de Mathématiques Appliquées, Angers, France.
• Représentation et traitement pratique de la flexibilité dans les problèmes sous contraintes (1992).
  Projet PRC-IA CSP Flexibles (19 membres) 4èmes journées nationales PRC-GDR IA, Marseille. pp. 369-428.

1991

• Overview of the CHIP Compiler System (1991).
  Abderrahmane Aggoun Nicolas Beldiceanu International Conference on Logic Programming, pp. 775-789.

1990

• Time stamps techniques for the trailed data in constraint logic programming systems (1990).
  Abderrahmane Aggoun Nicolas Beldiceanu 8ème Séminaire Programmation en Logique (SPLT'90), Trégastel, France. pp. 487-509.
• An Example of Introduction of Global Constraints in CHIP: Application to Block Theory Problems (1990).
  Nicolas Beldiceanu Technical report LP-49, ECRC.

1988

• Deterministic systems of sequential processes: theory and tools (1988).
  Younes Souissi Nicolas Beldiceanu Concurrency'88, Lecture Notes in Computer Science 335: 380-400.
• Langage de Règles et Moteur d'Inférences Basés sur des Contraintes et des Actions. Application aux Réseaux de Petri. (1988).
  Nicolas Beldiceanu PhD Thesis, Université Paris 6.
• AMI an Extensible Petri Nets Interactive Workshop (1988).
  Jean-Marc Bernard Jean-Luc Mounier Nicolas Beldiceanu Serge Haddad 9th European Workshop on Application and Theory of Petri Nets, Venice, Italy.

1987

• Un langage de règles de production basé sur des contraintes et des actions (1987).
  Nicolas Beldiceanu 7ème Conférence Internationale: les systèmes experts et leurs applications, pp. 1139-1158.