Maxence Delorme
Maxence Delorme
Email verificata su tilburguniversity.edu
Titolo
Citata da
Citata da
Anno
Bin packing and cutting stock problems: Mathematical models and exact algorithms
M Delorme, M Iori, S Martello
European Journal of Operational Research 255 (1), 1-20, 2016
1862016
BPPLIB: a library for bin packing and cutting stock problems
M Delorme, M Iori, S Martello
Optimization Letters 12 (2), 235-250, 2018
282018
Logic based Benders' decomposition for orthogonal stock cutting problems
M Delorme, M Iori, S Martello
Computers & Operations Research 78, 290-298, 2017
262017
Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems
M Delorme, M Iori
INFORMS Journal on Computing 32 (1), 101-119, 2020
232020
Mathematical models for stable matching problems with ties and incomplete lists
M Delorme, S García, J Gondzio, J Kalcsics, D Manlove, W Pettersson
European Journal of Operational Research 277 (2), 426-441, 2019
112019
Mathematical models and decomposition methods for the multiple knapsack problem
M Dell’Amico, M Delorme, M Iori, S Martello
European Journal of Operational Research 274 (3), 886-899, 2019
112019
Mathematical models and decomposition algorithms for makespan minimization in plastic rolls production
V Nesello, M Delorme, M Iori, A Subramanian
Journal of the operational research society, 1-14, 2017
72017
Training software for orthogonal packing problems
G Costa, M Delorme, M Iori, E Malaguti, S Martello
Computers & Industrial Engineering 111, 139-147, 2017
42017
Mathematical models and decomposition algorithms for cutting and packing problems
M Delorme
alma, 2017
42017
Improved flow-based formulations for the skiving stock problem
J Martinovic, M Delorme, M Iori, G Scheithauer, N Strasdat
Computers & Operations Research 113, 104770, 2020
2*2020
Integer Linear Programming for the Tutor Allocation Problem: A Practical Case in a British University
G Caselli, M Delorme, M Iori
arXiv preprint arXiv:2005.09442, 2020
12020
Improving solution times for stable matching problems through preprocessing
W Pettersson, M Delorme, S García, J Gondzio, J Kalcsics, D Manlove
Computers & Operations Research, 105128, 2020
2020
Improving solve times of stable matching problems through preprocessing
W Pettersson, M Delorme, S García, J Gondzio, J Kalcsics, D Manlove
2020
New algorithms for hierarchical optimisation in kidney exchange programmes
M Delorme, S García, J Gondzio, J Kalcsics, D Manlove, W Pettersson
Stability in the the Hospitals/Residents problem with Couples and Ties: Mathematical models and computational studies
M Delorme, S Garcıa, J Gondzio, J Kalcsics, D Manlove, W Pettersson
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–15