Hadrien Cambazard

According to our database1, Hadrien Cambazard authored at least 53 papers between 2004 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Innovative ideas for teaching supports: Application to Graph theory.
CoRR, 2022

Dealing with elementary paths in the Kidney Exchange Problem.
CoRR, 2022

Teaching OR: automatic evaluation for linear programming modelling.
4OR, 2022

2021
An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
An efficient and general approach for the joint order batching and picker routing problem.
Eur. J. Oper. Res., 2020

Lagrangian Decomposition for Classical Planning (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

New Randomized Strategies for the Color Coding Algorithm.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Tree Search for the Sequential Ordering Problem.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Analysis of Reduced Costs Filtering for Alldifferent and Minimum Weight Alldifferent Global Constraints.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
Tree search algorithms for the Sequential Ordering Problem.
CoRR, 2019

A global constraint for the capacitated single-item lot-sizing problem.
CoRR, 2019

Lagrangian Decomposition for Optimal Cost Partitioning.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane.
Eur. J. Oper. Res., 2018

Exact algorithms for the order picking problem.
Comput. Oper. Res., 2018

2017
Exact algorithms for the picking problem.
CoRR, 2017

Arc Consistency via Linear Programming.
Proceedings of the Principles and Practice of Constraint Programming, 2017

2016
A Branch-and-Price Algorithm for Scheduling Observations on a Telescope.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Alternative Filtering for the Weighted Circuit Constraint: Comparing Lower Bounds for the TSP and Solving TSPTW.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Bin Packing with Linear Usage Costs.
CoRR, 2015

New filtering for AtMostNValue and its weighted variant: A Lagrangian approach.
Constraints An Int. J., 2015

2014
A Constraint-Based Dental School Timetabling System.
AI Mag., 2014

Proactive Workload Consolidation for Reducing Energy Cost over a Given Time Horizon.
Proceedings of the 14th IEEE/ACM International Symposium on Cluster, 2014

2013
The Deployment of a Constraint-Based Dental School Timetabling System.
Proceedings of the Twenty-Fifth Innovative Applications of Artificial Intelligence Conference, 2013

Constraint Programming Based Large Neighbourhood Search for Energy Minimisation in Data Centres.
Proceedings of the Economics of Grids, Clouds, Systems, and Services, 2013

Bin Packing with Linear Usage Costs - An Application to Energy Management in Data Centres.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2012
An Optimal Constraint Programming Approach to the Open-Shop Problem.
INFORMS J. Comput., 2012

A shortest path-based approach to the multileaf collimator sequencing problem.
Discret. Appl. Math., 2012

Local search and constraint programming for the post enrolment-based course timetabling problem.
Ann. Oper. Res., 2012

A Computational Geometry-Based Local Search Algorithm for Planar Location Problems.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

A Constraint Programming Approach for the Traveling Purchaser Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks
CoRR, 2011

Domino portrait generation: a fast and scalable approach.
Ann. Oper. Res., 2011

A Combinatorial Optimisation Approach to the Design of Dual Parented Long-Reach Passive Optical Networks.
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

2010
Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation".
Constraints An Int. J., 2010

Knowledge Compilation for Itemset Mining.
Proceedings of the ECAI 2010, 2010

Hybrid Methods for the Multileaf Collimator Sequencing Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

Propagating the Bin Packing Constraint Using Linear Programming.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009
A constraint-based approach to Enigma 1225.
Comput. Math. Appl., 2009

2008
Solving a real-time allocation problem with constraint programming.
J. Syst. Softw., 2008

Reformulating Table Constraints using Functional Dependencies - An Application to Explanation Generation.
Constraints An Int. J., 2008

Fast and Scalable Domino Portrait Generation.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Reformulating Positive Table Constraints Using Functional Dependencies.
Proceedings of the Principles and Practice of Constraint Programming, 2008

A Hybrid Approach to Domino Portrait Generation.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
A Reformulation-Based Approach to Explanation in Constraint Satisfaction.
Proceedings of the Abstraction, 2007

Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem.
Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007

Solving the Minimum Number of Open Stacks Problem with Explanation-based Techniques.
Proceedings of the Explanation-Aware Computing, 2007

2006
Résolution de problèmes combinatoires par des approches fondées sur la notion d'explication. (Explanation-based algorithms in Constraint Programming).
PhD thesis, 2006

Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire.
RAIRO Oper. Res., 2006

Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming.
Constraints An Int. J., 2006

2005
Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming.
Proceedings of the ACM 2005 Symposium on Software Visualization, 2005

Integrating Benders Decomposition Within Constraint Programming.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming.
Proceedings of the Practice and Theory of Automated Timetabling V, 2004

Decomposition and Learning for a Hard Real Time Task Allocation Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2004


  Loading...