default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHadrien Cambazard
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j16]Hadrien Cambazard, Nicolas Catusse, Nadia Brauner
, Pierre Lemaire:
Teaching OR: automatic evaluation for linear programming modelling. 4OR 20(2): 333-345 (2022)- [i9]Lucie Pansart, Hadrien Cambazard, Nicolas Catusse:
Dealing with elementary paths in the Kidney Exchange Problem. CoRR abs/2201.08446 (2022) - [i8]Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Bernard Penz, Florian Fontan:
Innovative ideas for teaching supports: Application to Graph theory. CoRR abs/2209.05078 (2022) - 2021
- [c32]Hadrien Cambazard, Nicolas Catusse:
An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem. SoCG 2021: 20:1-20:13 - 2020
- [j15]Olivier Briant, Hadrien Cambazard, Diego Cattaruzza, Nicolas Catusse, Anne-Laure Ladier, Maxime Ogier:
An efficient and general approach for the joint order batching and picker routing problem. Eur. J. Oper. Res. 285(2): 497-512 (2020) - [c31]Guillaume Claus, Hadrien Cambazard, Vincent Jost:
Analysis of Reduced Costs Filtering for Alldifferent and Minimum Weight Alldifferent Global Constraints. ECAI 2020: 323-330 - [c30]Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost:
Tree Search for the Sequential Ordering Problem. ECAI 2020: 459-465 - [c29]Lucie Pansart, Hadrien Cambazard, Nicolas Catusse:
New Randomized Strategies for the Color Coding Algorithm. ECAI 2020: 466-473 - [c28]Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin:
Lagrangian Decomposition for Classical Planning (Extended Abstract). IJCAI 2020: 4770-4774 - [i7]Hadrien Cambazard, Nicolas Catusse:
An integer programming formulation using convex polygons for the convex partition problem. CoRR abs/2012.07939 (2020)
2010 – 2019
- 2019
- [c27]Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin:
Lagrangian Decomposition for Optimal Cost Partitioning. ICAPS 2019: 338-347 - [i6]Grigori German, Hadrien Cambazard, Jean-Philippe Gayon, Bernard Penz:
A global constraint for the capacitated single-item lot-sizing problem. CoRR abs/1907.02405 (2019) - [i5]Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost:
Tree search algorithms for the Sequential Ordering Problem. CoRR abs/1911.12427 (2019) - 2018
- [j14]Lucie Pansart, Nicolas Catusse, Hadrien Cambazard:
Exact algorithms for the order picking problem. Comput. Oper. Res. 100: 117-127 (2018) - [j13]Hadrien Cambazard, Nicolas Catusse:
Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane. Eur. J. Oper. Res. 270(2): 419-429 (2018) - 2017
- [c26]Grigori German, Olivier Briant, Hadrien Cambazard, Vincent Jost:
Arc Consistency via Linear Programming. CP 2017: 114-128 - [i4]Lucie Pansart, Nicolas Catusse, Hadrien Cambazard:
Exact algorithms for the picking problem. CoRR abs/1703.00699 (2017) - 2016
- [c25]Sylvain Ducomman, Hadrien Cambazard, Bernard Penz:
Alternative Filtering for the Weighted Circuit Constraint: Comparing Lower Bounds for the TSP and Solving TSPTW. AAAI 2016: 3390-3396 - [c24]Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Pierre Lemaire, Bernard Penz, Anne-Marie Lagrange, Pascal Rubini:
A Branch-and-Price Algorithm for Scheduling Observations on a Telescope. IJCAI 2016: 3060-3066 - 2015
- [j12]Hadrien Cambazard, Jean-Guillaume Fages:
New filtering for AtMostNValue and its weighted variant: A Lagrangian approach. Constraints An Int. J. 20(3): 362-380 (2015) - [i3]Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Bin Packing with Linear Usage Costs. CoRR abs/1509.06712 (2015) - [i2]Hadrien Cambazard, Nicolas Catusse:
Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane. CoRR abs/1512.06649 (2015) - 2014
- [j11]Hadrien Cambazard, Barry O'Sullivan, Helmut Simonis:
A Constraint-Based Dental School Timetabling System. AI Mag. 35(1): 53-63 (2014) - [c23]Milan De Cauwer, Deepak Mehta, Barry O'Sullivan, Helmut Simonis, Hadrien Cambazard:
Proactive Workload Consolidation for Reducing Energy Cost over a Given Time Horizon. CCGRID 2014: 558-561 - 2013
- [c22]Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, Louis-Martin Rousseau:
An Optimal Constraint Programming Approach to the Open-Shop Problem. ICAPS 2013 - [c21]Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Bin Packing with Linear Usage Costs - An Application to Energy Management in Data Centres. CP 2013: 47-62 - [c20]Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Constraint Programming Based Large Neighbourhood Search for Energy Minimisation in Data Centres. GECON 2013: 44-59 - [c19]Hadrien Cambazard, Barry O'Sullivan, Helmut Simonis:
The Deployment of a Constraint-Based Dental School Timetabling System. IAAI 2013: 1459-1464 - 2012
- [j10]Hadrien Cambazard, Emmanuel Hebrard, Barry O'Sullivan, Alexandre Papadopoulos:
Local search and constraint programming for the post enrolment-based course timetabling problem. Ann. Oper. Res. 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. Discret. Appl. Math. 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 J. Comput. 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. Ann. Oper. Res. 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 An Int. J. 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
2000 – 2009
- 2009
- [j5]Hadrien Cambazard, Barry O'Sullivan, Barbara M. Smith:
A constraint-based approach to Enigma 1225. Comput. Math. Appl. 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 An Int. J. 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. J. Syst. Softw. 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
- [b1]Hadrien Cambazard:
Résolution de problèmes combinatoires par des approches fondées sur la notion d'explication. (Explanation-based algorithms in Constraint Programming). University of Nantes, France, 2006 - [j2]Hadrien Cambazard, Narendra Jussien:
Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming. Constraints An Int. J. 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 Oper. Res. 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
