Maxence Delorme

Orcid: 0000-0003-3730-0894

According to our database1, Maxence Delorme authored at least 19 papers between 2016 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints.
Comput. Oper. Res., March, 2024

2023
Half-cycle: A new formulation for modelling kidney exchange problems.
Oper. Res. Lett., May, 2023

2022
Integer Linear Programming for the Tutor Allocation Problem: A practical case in a British University.
Expert Syst. Appl., 2022

Improved instance generation for kidney exchange programmes.
Comput. Oper. Res., 2022

2021
Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events.
Eur. J. Oper. Res., 2021

Improving solution times for stable matching problems through preprocessing.
Comput. Oper. Res., 2021

A Mathematical Formulation for Reducing Overcrowding in Hospitals' Waiting Rooms.
Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2021

2020
Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems.
INFORMS J. Comput., 2020

Improved flow-based formulations for the skiving stock problem.
Comput. Oper. Res., 2020

2019
Mathematical models for stable matching problems with ties and incomplete lists.
Eur. J. Oper. Res., 2019

Mathematical models and decomposition methods for the multiple knapsack problem.
Eur. J. Oper. Res., 2019

2018
BPPLIB: a library for bin packing and cutting stock problems.
Optim. Lett., 2018

Mathematical models and decomposition algorithms for makespan minimization in plastic rolls production.
J. Oper. Res. Soc., 2018

Mathematical models and decomposition algorithms for cutting and packing problems.
4OR, 2018

An Improved Arcflow Model for the Skiving Stock Problem.
Proceedings of the Operations Research Proceedings 2018, 2018

2017
Mathematical Models and Decomposition Algorithms for Cutting and Packing Problems.
PhD thesis, 2017

Logic based Benders' decomposition for orthogonal stock cutting problems.
Comput. Oper. Res., 2017

Training software for orthogonal packing problems.
Comput. Ind. Eng., 2017

2016
Bin packing and cutting stock problems: Mathematical models and exact algorithms.
Eur. J. Oper. Res., 2016


  Loading...