Bibliography

Major publications by the team in recent years

1N. Beldiceanu, M. Carlsson, S. Demassey, T. Petit.

Global Constraint Catalog: Past, Present and Future, in: Constraints, 2007, vol. 12, n^o 1, p. 21-62.

http://hal.archives-ouvertes.fr/hal-00481554/en/
2N. Beldiceanu, M. Carlsson, S. Demassey, E. Poder.

New Filtering for the cumulative constraint in the context of non-overlapping rectangles, in: Annals of Operations Research, 2010, p. 1-20. [ DOI : 10.1007/s10479-010-0731-0 ]

http://hal.archives-ouvertes.fr/hal-00485563/en/
3N. Beldiceanu, M. Carlsson, E. Poder, R. Sadek, C. Truchet.

A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects, in: 13th International on Principles and Practice of Constraint Programming (CP'07) 13th International on Principles and Practice of Constraint Programming (CP'07), Brown États-Unis, 2007, vol. 4741, p. 180-194.

http://hal.archives-ouvertes.fr/hal-00481558/en/
4N. Beldiceanu, P. Flener, X. Lorca.

Combining tree Partitioning, Precedence, and Incomparability Constraints, in: Constraints, 2008, vol. 13, n^o 4, p. 459-489. [ DOI : 10.1007/s10601-007-9040-x ]

http://hal.archives-ouvertes.fr/hal-00481533/en/
5C. Bessiere, R. Debruyne.

Theoretical Analysis of Singleton Arc Consistency and Its Extensions", in: Artificial Intelligence, 01 2008, vol. 172, n^o 1, p. 29-41.

http://hal-lirmm.ccsd.cnrs.fr/lirmm-00230949/en/
6C. Bessiere, T. Petit, B. Zanuttini.

Making Bound Consistency as Effective as Arc Consistency, in: IJCAI'09, 2009.

http://hal-lirmm.ccsd.cnrs.fr/lirmm-00382609/en/
7H. Cambazard, N. Jussien.

Identifying and exploiting problem structures using explanation-based constraint programming, in: Constraints, 2006, vol. 11, n^o 4, p. 295-313. [ DOI : 10.1007/s10601-006-9002-8 ]

http://hal.archives-ouvertes.fr/hal-00293899/en/
8G. Chabert, N. Beldiceanu.

Sweeping with Continous Domains, in: 16th International Conference on Principles and Practice of Constraint Programming (CP'10), St Andrews, Scotland, D. Cohen (editor), Lecture Notes in Computer Science, Springer-Verlag, 2010, vol. 6308, p. 137-151.
9G. Chabert, L. Jaulin.

Contractor Programming, in: Artificial Intelligence, 2009, vol. 173, p. 1079-1100. [ DOI : 10.1016/j.artint.2009.03.002 ]

http://hal.archives-ouvertes.fr/hal-00428957/en/
10J.-M. Normand, A. Goldsztejn, M. Christie, F. Benhamou.

A Branch and Bound Algorithm for Numerical MAX-CSP, in: LNCS The 14th International Conference on Principles and Practice of Constraint Programming, Australie, 09 2008, vol. 5202/2008, p. 205-219, Best student paper award. [ DOI : 10.1007/978-3-540-85958-1_14 ]

http://hal.archives-ouvertes.fr/hal-00481180/en/

Publications of the year

Articles in International Peer-Reviewed Journals

11N. Beldiceanu, M. Carlsson, P. Flener, J. Pearson.

On Matrices, Automata, and Double Counting in Constraint Programming, in: Constraints, 2012.

http://dx.doi.org/10.1007/s10601-012-9134-y
12N. Beldiceanu, M. Carlsson, P. Flener, J. Pearson.

On the Reification of Global Constraints, in: Constraints, 2012, vol. 17, n^o 4.

http://dx.doi.org/10.1007/s10601-012-9132-0

Invited Conferences

13T. Petit.

Problèmes d'optimisation sur des séquences, in: 8èmes Journèes Francophones de Programmation par Contraintes (JFPC'12), Toulouse, France, 2012, p. 3–3.
14H. Simonis, N. Beldiceanu.

Building global constraint models from positive examples, in: 21th International Symposium on Mathematical Programming (ISMP'12), Berlin, Germany, august 2012.
15H. Simonis, N. Beldiceanu.

A Model Seeker: Extracting Global Constraint Models From Positive Examples, in: 2013 INFORMS Computing Society Conference, Santa Fe, USA, january 2013, to appear.

International Conferences with Proceedings

16I. Araya, G. Trombettoni, B. Neveu, G. Chabert.

Upper Bounding in Inner Regions for Global Optimization under Inequality Constraints, in: GLOBAL OPTIMIZATION WORKSHOP 2012, Natal, Brazil, 2012, p. 25-29.

http://hal.inria.fr/hal-00733860
17N. Beldiceanu, M. Carlsson, T. Petit, J.-C. Régin.

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, in: 20th European Conference on Artificial Intelligence (ECAI'12), Montpellier, France, L. De Raedt, C. Bessiere, D. Dubois, P. Doherty, P. Frasconi, F. Heintz, P. J. F. Lucas (editors), Frontiers in Artificial Intelligence and Applications, IOS Press, august 2012, vol. 242, p. 145–150.

http://dx.doi.org/10.3233/978-1-61499-098-7-145
18N. Beldiceanu, M. Carlsson, T. Petit, J.-C. Régin.

An $O (n l o g n)$ Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization, in: ECAI, 2012, p. 145–150.
19N. Beldiceanu, H. Simonis.

A Model Seeker: Extracting Global Constraint Models from Positive Examples, in: 18th International Conference on Principles and Practice of Constraint Programming (CP'12), Quebec City, Canada, M. Milano (editor), Lecture Notes in Computer Science, Springer-Verlag, october 2012, vol. 7514, p. 141–157.

http://link.springer.com/chapter/10.1007/978-3-642-33558-7_13
20Y. Caniou, D. Diaz, F. Richoux, P. Codognet, S. Abreu.

Performance Analysis of Parallel Constraint-Based Local Search, in: 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'12), New Orleans, LA, USA, ACM Press, 2012, poster paper.
21G. Chabert, S. Demassey.

The Conjunction of Interval among Constraints, in: 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12), Lectures Notes in Computer Science, Springer Verlag, 2012, vol. 7298, p. 113–128.
22D. Diaz, F. Richoux, Y. Caniou, P. Codognet, S. Abreu.

Parallel Local Search for the Costas Array Problem, in: Parallel Computing and Optimization, Shanghai, China, IEEE, 2012.
23D. Diaz, F. Richoux, P. Codognet, Y. Caniou, S. Abreu.

Constraint-based Local Search for the Costas Array Problem, in: Learning and Intelligent OptimizatioN Conference (LION 6), Paris, France, Springer LNCS, 2012.
24A. Letort, N. Beldiceanu, M. Carlsson.

A Scalable Sweep Algorithm for the cumulative Constraint, in: 18th International Conference on Principles and Practice of Constraint Programming (CP'12), Quebec City, Canada, M. Milano (editor), Lecture Notes in Computer Science, Springer-Verlag, october 2012, vol. 7514, p. 439–454.

http://dx.doi.org/10.1007/978-3-642-33558-7
25A. Letort, M. Carlsson, N. Beldiceanu.

A Synchronized Sweep Algorithm for the $k$ -dimensional cumulative Constraint, in: 10th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'13), Lectures Notes in Computer Science, Springer Verlag, 2013, (to appear).
26M. Pelleau, A. Miné, C. Truchet, F. Benhamou.

A Constraint Solver based on Abstract Domains, in: 14th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI2013), Roma, Italy, Lecture Notes in Computer Science, Springer-Verlag, 2013, (to appear).
27T. Petit.

Focus : A Constraint for Concentrating High Costs, in: 18th International Conference on Principles and Practice of Constraint Programming (CP'12), Quebec City, Canada, M. Milano (editor), Lecture Notes in Computer Science, Springer-Verlag, october 2012, vol. 7514, p. 577–592.

http://dx.doi.org/10.1007/978-3-642-33558-7
28T. Petit.

Intermediary Local Consistencies, in: ECAI, 2012, p. 919–920.
29J. du Boisberranger, D. Gardy, X. Lorca, C. Truchet.

When is it worthwhile to propagate a constraint? A probabilistic analysis of alldifferent, in: ANALCO 13th Meeting on Analytic Algorithmics and Combinatorics, New Orleans, Louisiana, USA, january 2013, to appear.

National Conferences with Proceeding

30G. Trombettoni, I. Araya, B. Neveu, G. Chabert.

IbexOpt : un module d'optimisation globale sous contraintes fiable, in: 13e congrès annuel de la Société française de Recherche Opérationnelle et d'Aide à la Décision, Angers, France, 2012, 2p p.

http://hal.inria.fr/hal-00733916

Conferences without Proceedings

31N. Beldiceanu, P. Flener, J.-N. Monette, J. Pearson, H. Simonis.

Some Research Challenges and Remarks on CP, in: Position Papers on the Future of Constraint Programming, Quebec City, Canada, october 2012.
32T. Petit.

Focus: A Constraint for Concentrating High Costs, in: Proc. First International Workshop on Search Strategies and Non-standard Objectives, (CPAIOR-SSNOW'12), 2012.
33H. Simonis, N. Beldiceanu.

A Model Seeker: Extracting Global Constraint Models From Positive Examples, in: First workshop on COmbining COnstraint solving with MIning and LEarning (CoCoMile'12), Montpellier, France, august 2012.

Books or Proceedings Editing

34N. Beldiceanu, N. Jussien, É. Pinson (editors)

9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12), Lectures Notes in Computer Science, Springer Verlag, Nantes, France, june 2012, vol. 7298.

http://dx.doi.org/10.1007/978-3-642-29828-8

Internal Reports

35N. Beldiceanu, M. Carlsson, P. Flener, J. Pearson.

On the Reification of Global Constraints, Swedish Institute of Computer Science, 2012, n^o T2012-02.

http://soda.swedish-ict.se/5194/
36N. Beldiceanu, M. Carlsson, J.-X. Rampon.

Global Constraint Catalog, 2nd Edition (revision a), Swedish Institute of Computer Science, 2012, n^o T2012-03.

http://soda.swedish-ict.se/5195/
37G. Chabert, R. Douence.

From Implicit to Explicit Pavings, Inria, July 2012, n^o RR-8028.

http://hal.inria.fr/hal-00720739

Previous |

Home