Maxence Delorme

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Extending the reflect flow formulation to variable-sized one-dimensional cutting and skiving stock problems European Journal of Operational Research	2026-06-09	Paper
Operational research approaches and mathematical models for kidney exchange: a literature survey and empirical evaluation European Journal of Operational Research	2026-04-27	Paper
Solving the strip packing problem with a decomposition framework and a generic solver: implementation, tuning, and reinforcement-learning-based hybridization Computers & Operations Research	2026-02-10	Paper
Satellite scheduling problems: a survey of applications in Earth and outer space observation Computers & Operations Research	2025-05-26	Paper
Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies European Journal of Operational Research	2025-05-20	Paper
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation European Journal of Operational Research	2025-05-19	Paper
New algorithms for hierarchical optimization in kidney exchange programs Operations Research	2024-09-05	Paper
Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints Computers & Operations Research	2024-06-06	Paper
Arcflow Formulations and Constraint Generation Frameworks for the Two Bar Charts Packing Problem INFORMS Journal on Computing	2024-02-28	Paper
Mixed Integer Linear Programming for a Real-World Parallel Machine Scheduling Problem with Workforce and Precedence Constraints AIRO Springer Series	2023-07-31	Paper
Half-cycle: a new formulation for modelling kidney exchange problems Operations Research Letters	2023-07-03	Paper
Improved instance generation for kidney exchange programmes Computers & Operations Research	2022-03-09	Paper
Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events European Journal of Operational Research	2021-11-09	Paper
Improving solution times for stable matching problems through preprocessing Computers & Operations Research	2021-05-21	Paper
Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems INFORMS Journal on Computing	2020-12-11	Paper
Mathematical models for stable matching problems with ties and incomplete lists European Journal of Operational Research	2019-04-23	Paper
Mathematical models and decomposition methods for the multiple knapsack problem European Journal of Operational Research	2019-01-09	Paper
Logic based Benders' decomposition for orthogonal stock cutting problems Computers & Operations Research	2018-07-11	Paper
BPPLIB: a library for bin packing and cutting stock problems Optimization Letters	2018-04-19	Paper
Bin packing and cutting stock problems: mathematical models and exact algorithms European Journal of Operational Research	2016-10-07	Paper

Research outcomes over time

This page was built for person: Maxence Delorme