Arnaud Malapert

Orcid: 0000-0003-0099-479X

According to our database1, Arnaud Malapert authored at least 19 papers between 2009 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Toward a Global Constraint for Minimizing the Flowtime.
Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, 2024

2023
MDD Archive for Boosting the Pareto Constraint.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2020
Filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2020

2019
Non-overlapping Sequence-Dependent Setup Scheduling with Dedicated Tasks.
Proceedings of the Operations Research and Enterprise Systems, 2019

Flight Radius Algorithms.
Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019

A New CP-Approach for a Parallel Machine Scheduling Problem with Time Constraints on Machine Qualifications.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

2018
Puzzle - Solving the <i>n</i>-Fractions Puzzle as a Constraint Programming Problem.
INFORMS Trans. Educ., 2018

Solving the Flight Radius Problem.
Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, 2018

Parallel Constraint Programming.
Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017
A Synergic Approach to the Minimal Uncompletable Words Problem.
J. Autom. Lang. Comb., 2017

2016
Embarrassingly Parallel Search in Constraint Programming.
J. Artif. Intell. Res., 2016

2014
Improvement of the Embarrassingly Parallel Search for Data Centers.
Proceedings of the Principles and Practice of Constraint Programming, 2014

2013
The Package Server Location Problem.
Proceedings of the ICORES 2013, 2013

Embarrassingly Parallel Search.
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 constraint programming approach for a batch processing problem with non-identical job sizes.
Eur. J. Oper. Res., 2012

Shop and batch scheduling with constraints.
4OR, 2012

2011
Techniques d'ordonnancement d'atelier et de fournées basées sur la programmation par contraintes. (Shop and batch scheduling with constraints).
PhD thesis, 2011

2009
Closing the Open Shop: Contradicting Conventional Wisdom.
Proceedings of the Principles and Practice of Constraint Programming, 2009


  Loading...