| 2012 | ||
|---|---|---|
| j10 | Hadrien Cambazard, Emmanuel Hebrard, Barry O'Sullivan, Alexandre Papadopoulos: Local search and constraint programming for the post enrolment-based course timetabling problem. Annals OR 194(1): 111-135 (2012) | |
| j9 | Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan: A shortest path-based approach to the multileaf collimator sequencing problem. Discrete Applied Mathematics 160(1-2): 81-99 (2012) | |
| j8 | Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, Louis-Martin Rousseau: An Optimal Constraint Programming Approach to the Open-Shop Problem. INFORMS Journal on Computing 24(2): 228-244 (2012) | |
| c18 | Hadrien Cambazard, Bernard Penz: A Constraint Programming Approach for the Traveling Purchaser Problem. CP 2012: 735-749 | |
| c17 | Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada: A Computational Geometry-Based Local Search Algorithm for Planar Location Problems. CPAIOR 2012: 97-112 | |
| 2011 | ||
| j7 | Hadrien Cambazard, John Horan, Eoin O'Mahony, Barry O'Sullivan: Domino portrait generation: a fast and scalable approach. Annals OR 184(1): 79-95 (2011) | |
| c16 | Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle: A Combinatorial Optimisation Approach to the Design of Dual Parented Long-Reach Passive Optical Networks. ICTAI 2011: 785-792 | |
| i1 | Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle: A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks. CoRR abs/1109.1231 (2011) | |
| 2010 | ||
| j6 | Hadrien Cambazard, Barry O'Sullivan: Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation". Constraints 15(1): 145-147 (2010) | |
| c15 | Hadrien Cambazard, Barry O'Sullivan: Propagating the Bin Packing Constraint Using Linear Programming. CP 2010: 129-136 | |
| c14 | Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan: Hybrid Methods for the Multileaf Collimator Sequencing Problem. CPAIOR 2010: 56-70 | |
| c13 | Hadrien Cambazard, Tarik Hadzic, Barry O'Sullivan: Knowledge Compilation for Itemset Mining. ECAI 2010: 1109-1110 | |
| 2009 | ||
| j5 | Hadrien Cambazard, Barry O'Sullivan, Barbara M. Smith: A constraint-based approach to Enigma 1225. Computers & Mathematics with Applications 58(8): 1487-1497 (2009) | |
| c12 | Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan: A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem. CPAIOR 2009: 41-55 | |
| 2008 | ||
| j4 | Hadrien Cambazard, Barry O'Sullivan: Reformulating Table Constraints using Functional Dependencies - An Application to Explanation Generation. Constraints 13(3): 385-406 (2008) | |
| j3 | Pierre-Emmanuel Hladik, Hadrien Cambazard, Anne-Marie Déplanche, Narendra Jussien: Solving a real-time allocation problem with constraint programming. Journal of Systems and Software 81(1): 132-149 (2008) | |
| c11 | Hadrien Cambazard, John Horan, Eoin O'Mahony, Barry O'Sullivan: A Hybrid Approach to Domino Portrait Generation. AAAI 2008: 1874-1875 | |
| c10 | Hadrien Cambazard, Barry O'Sullivan: Reformulating Positive Table Constraints Using Functional Dependencies. CP 2008: 418-432 | |
| c9 | Hadrien Cambazard, John Horan, Eoin O'Mahony, Barry O'Sullivan: Fast and Scalable Domino Portrait Generation. CPAIOR 2008: 51-65 | |
| 2007 | ||
| c8 | Hadrien Cambazard, Narendra Jussien: Solving the Minimum Number of Open Stacks Problem with Explanation-based Techniques. ExaCt 2007: 14-19 | |
| c7 | Hadrien Cambazard, Narendra Jussien: Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem. LION 2007: 69-80 | |
| c6 | Hadrien Cambazard, Barry O'Sullivan: A Reformulation-Based Approach to Explanation in Constraint Satisfaction. SARA 2007: 395-396 | |
| 2006 | ||
| j2 | Hadrien Cambazard, Narendra Jussien: Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming. Constraints 11(4): 295-313 (2006) | |
| j1 | Hadrien Cambazard, Narendra Jussien: Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire. RAIRO - Operations Research 40(4): 381-401 (2006) | |
| 2005 | ||
| c5 | Hadrien Cambazard, Narendra Jussien: Integrating Benders Decomposition Within Constraint Programming. CP 2005: 752-756 | |
| c4 | Hadrien Cambazard, Narendra Jussien: Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming. CPAIOR 2005: 94-109 | |
| c3 | Mohammad Ghoniem, Hadrien Cambazard, Jean-Daniel Fekete, Narendra Jussien: Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming. SOFTVIS 2005: 27-36 | |
| 2004 | ||
| c2 | Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Marie Déplanche, Narendra Jussien, Yvon Trinquet: Decomposition and Learning for a Hard Real Time Task Allocation Problem. CP 2004: 153-167 | |
| c1 | Hadrien Cambazard, Fabien Demazeau, Narendra Jussien, Philippe David: Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming. PATAT 2004: 190-207 | |
Data released under the ODC-BY 1.0 license — See also our legal information page