Hadrien Cambazard

60 papers A* 7A 11B 7C 2Journal 27Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses. Oper. Res. Lett. Paul Revenant, Hadrien Cambazard, Nicolas Catusse
2025	J	`jnl`	Arc-consistency with linear programming reduced costs (applied to stable set in chordal graphs). Artif. Intell. Guillaume Claus, Hadrien Cambazard, Hugo Apeloig, Pierre Hoppenot
2022	J	`jnl`	Dealing with elementary paths in the Kidney Exchange Problem. CoRR Lucie Pansart, Hadrien Cambazard, Nicolas Catusse
2022	J	`jnl`	Innovative ideas for teaching supports: Application to Graph theory. CoRR Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Bernard Penz, Florian Fontan
2022	J	`jnl`	Teaching OR: automatic evaluation for linear programming modelling. 4OR Hadrien Cambazard, Nicolas Catusse, Nadia Brauner, Pierre Lemaire
2021	A*	`conf`	An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem. SoCG Hadrien Cambazard, Nicolas Catusse
2020	J	`jnl`	An efficient and general approach for the joint order batching and picker routing problem. Eur. J. Oper. Res. Olivier Briant, Hadrien Cambazard, Diego Cattaruzza, Nicolas Catusse, Anne-Laure Ladier, Maxime Ogier
2020	J	`jnl`	An integer programming formulation using convex polygons for the convex partition problem. CoRR Hadrien Cambazard, Nicolas Catusse
2020	A	`conf`	Analysis of Reduced Costs Filtering for Alldifferent and Minimum Weight Alldifferent Global Constraints. ECAI Guillaume Claus, Hadrien Cambazard, Vincent Jost
2020	A*	`conf`	Lagrangian Decomposition for Classical Planning (Extended Abstract). IJCAI Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin
2020	A	`conf`	New Randomized Strategies for the Color Coding Algorithm. ECAI Lucie Pansart, Hadrien Cambazard, Nicolas Catusse
2020	A	`conf`	Tree Search for the Sequential Ordering Problem. ECAI Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost
2019	J	`jnl`	A global constraint for the capacitated single-item lot-sizing problem. CoRR Grigori German, Hadrien Cambazard, Jean-Philippe Gayon, Bernard Penz
2019	A*	`conf`	Lagrangian Decomposition for Optimal Cost Partitioning. ICAPS Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin
2019	J	`jnl`	Tree search algorithms for the Sequential Ordering Problem. CoRR Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost
2018	J	`jnl`	Exact algorithms for the order picking problem. Comput. Oper. Res. Lucie Pansart, Nicolas Catusse, Hadrien Cambazard
2018	J	`jnl`	Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane. Eur. J. Oper. Res. Hadrien Cambazard, Nicolas Catusse
2017	A	`conf`	Arc Consistency via Linear Programming. CP Grigori German, Olivier Briant, Hadrien Cambazard, Vincent Jost
2017	J	`jnl`	Exact algorithms for the picking problem. CoRR Lucie Pansart, Nicolas Catusse, Hadrien Cambazard
2016	A*	`conf`	A Branch-and-Price Algorithm for Scheduling Observations on a Telescope. IJCAI Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Pierre Lemaire, Bernard Penz, Anne-Marie Lagrange, Pascal Rubini
2016	A*	`conf`	Alternative Filtering for the Weighted Circuit Constraint: Comparing Lower Bounds for the TSP and Solving TSPTW. AAAI Sylvain Ducomman, Hadrien Cambazard, Bernard Penz
2015	J	`jnl`	Bin Packing with Linear Usage Costs. CoRR Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis
2015	J	`jnl`	Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane. CoRR Hadrien Cambazard, Nicolas Catusse
2015	J	`jnl`	New filtering for AtMostNValue and its weighted variant: A Lagrangian approach. Constraints An Int. J. Hadrien Cambazard, Jean-Guillaume Fages
2014	J	`jnl`	A Constraint-Based Dental School Timetabling System. AI Mag. Hadrien Cambazard, Barry O'Sullivan, Helmut Simonis
2014	B	`conf`	Proactive Workload Consolidation for Reducing Energy Cost over a Given Time Horizon. CCGRID Milan De Cauwer, Deepak Mehta, Barry O'Sullivan, Helmut Simonis, Hadrien Cambazard
2013	A*	`conf`	An Optimal Constraint Programming Approach to the Open-Shop Problem. ICAPS Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, Louis-Martin Rousseau
2013	A	`conf`	Bin Packing with Linear Usage Costs - An Application to Energy Management in Data Centres. CP Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis
2013	—	`conf`	Constraint Programming Based Large Neighbourhood Search for Energy Minimisation in Data Centres. GECON Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis
2013	C	`conf`	The Deployment of a Constraint-Based Dental School Timetabling System. IAAI Hadrien Cambazard, Barry O'Sullivan, Helmut Simonis
2012	B	`conf`	A Computational Geometry-Based Local Search Algorithm for Planar Location Problems. CPAIOR Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada
2012	A	`conf`	A Constraint Programming Approach for the Traveling Purchaser Problem. CP Hadrien Cambazard, Bernard Penz
2012	J	`jnl`	A shortest path-based approach to the multileaf collimator sequencing problem. Discret. Appl. Math. Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
2012	J	`jnl`	An Optimal Constraint Programming Approach to the Open-Shop Problem. INFORMS J. Comput. Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, Louis-Martin Rousseau
2012	J	`jnl`	Local search and constraint programming for the post enrolment-based course timetabling problem. Ann. Oper. Res. Hadrien Cambazard, Emmanuel Hebrard, Barry O'Sullivan, Alexandre Papadopoulos
2011	J	`jnl`	A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks CoRR Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle
2011	B	`conf`	A Combinatorial Optimisation Approach to the Design of Dual Parented Long-Reach Passive Optical Networks. ICTAI Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle
2011	J	`jnl`	Domino portrait generation: a fast and scalable approach. Ann. Oper. Res. Hadrien Cambazard, John Horan, Eoin O'Mahony, Barry O'Sullivan
2010	J	`jnl`	Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation". Constraints An Int. J. Hadrien Cambazard, Barry O'Sullivan
2010	B	`conf`	Hybrid Methods for the Multileaf Collimator Sequencing Problem. CPAIOR Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
2010	A	`conf`	Knowledge Compilation for Itemset Mining. ECAI Hadrien Cambazard, Tarik Hadzic, Barry O'Sullivan
2010	A	`conf`	Propagating the Bin Packing Constraint Using Linear Programming. CP Hadrien Cambazard, Barry O'Sullivan
2009	B	`conf`	A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem. CPAIOR Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
2009	J	`jnl`	A constraint-based approach to Enigma 1225. Comput. Math. Appl. Hadrien Cambazard, Barry O'Sullivan, Barbara M. Smith
2008	A*	`conf`	A Hybrid Approach to Domino Portrait Generation. AAAI Hadrien Cambazard, John Horan, Eoin O'Mahony, Barry O'Sullivan
2008	B	`conf`	Fast and Scalable Domino Portrait Generation. CPAIOR Hadrien Cambazard, John Horan, Eoin O'Mahony, Barry O'Sullivan
2008	A	`conf`	Reformulating Positive Table Constraints Using Functional Dependencies. CP Hadrien Cambazard, Barry O'Sullivan
2008	J	`jnl`	Reformulating Table Constraints using Functional Dependencies - An Application to Explanation Generation. Constraints An Int. J. Hadrien Cambazard, Barry O'Sullivan
2008	J	`jnl`	Solving a real-time allocation problem with constraint programming. J. Syst. Softw. Pierre-Emmanuel Hladik, Hadrien Cambazard, Anne-Marie Déplanche, Narendra Jussien
2007	—	`conf`	A Reformulation-Based Approach to Explanation in Constraint Satisfaction. SARA Hadrien Cambazard, Barry O'Sullivan
2007	—	`conf`	Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem. LION Hadrien Cambazard, Narendra Jussien
2007	—	`conf`	Solving the Minimum Number of Open Stacks Problem with Explanation-based Techniques. ExaCt Hadrien Cambazard, Narendra Jussien
2006	J	`jnl`	Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire. RAIRO Oper. Res. Hadrien Cambazard, Narendra Jussien
2006	J	`jnl`	Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming. Constraints An Int. J. Hadrien Cambazard, Narendra Jussien
2006	—	`—`	Résolution de problèmes combinatoires par des approches fondées sur la notion d'explication. (Explanation-based algorithms in Constraint Programming). Hadrien Cambazard
2005	B	`conf`	Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming. CPAIOR Hadrien Cambazard, Narendra Jussien
2005	A	`conf`	Integrating Benders Decomposition Within Constraint Programming. CP Hadrien Cambazard, Narendra Jussien
2005	—	`conf`	Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming. SOFTVIS Mohammad Ghoniem, Hadrien Cambazard, Jean-Daniel Fekete, Narendra Jussien
2004	A	`conf`	Decomposition and Learning for a Hard Real Time Task Allocation Problem. CP Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Marie Déplanche, Narendra Jussien, Yvon Trinquet
2004	C	`conf`	Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming. PATAT Hadrien Cambazard, Fabien Demazeau, Narendra Jussien, Philippe David