Takip et
Maxence Delorme
Maxence Delorme
Tilburg University
tilburguniversity.edu üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
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
4662016
Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems
M Delorme, M Iori
INFORMS Journal on Computing 32 (1), 101-119, 2020
1042020
BPPLIB: a library for bin packing and cutting stock problems
M Delorme, M Iori, S Martello
Optimization Letters 12, 235-250, 2018
842018
Logic based Benders' decomposition for orthogonal stock cutting problems
M Delorme, M Iori, S Martello
Computers & Operations Research 78, 290-298, 2017
732017
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
642019
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
552019
Improved instance generation for kidney exchange programmes
M Delorme, S Garcia, J Gondzio, J Kalcsics, D Manlove, W Pettersson, ...
Computers & Operations Research 141, 105707, 2022
272022
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
262020
Energy-efficient Automated Vertical Farms
M Delorme, A Santini
Omega 109, 102611, 2022
252022
New algorithms for hierarchical optimization in kidney exchange programs
M Delorme, S García, J Gondzio, J Kalcsics, D Manlove, W Pettersson
Operations Research 72 (4), 1654-1673, 2024
232024
Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
M Delorme, M Iori, NFM Mendes
European Journal of Operational Research 295 (3), 823-837, 2021
222021
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 128, 105128, 2021
152021
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 69 (3), 326-339, 2018
132018
Half-cycle: A new formulation for modelling kidney exchange problems
M Delorme, D Manlove, T Smeets
Operations Research Letters 51 (3), 234-241, 2023
102023
Stability in 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
Omega 103, 102386, 2021
102021
Integer linear programming for the tutor allocation problem: A practical case in a british university
G Caselli, M Delorme, M Iori
Expert Systems with Applications 187, 115967, 2022
92022
Training software for orthogonal packing problems
G Costa, M Delorme, M Iori, E Malaguti, S Martello
Computers & Industrial Engineering 111, 139-147, 2017
92017
Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
G Caselli, M Delorme, M Iori, CA Magni
Computers & Operations Research 163, 106484, 2024
7*2024
Exact decomposition approaches for a single container loading problem with stacking constraints and medium-sized weakly heterogeneous items
M Delorme, J Wagenaar
Omega 125, 103039, 2024
62024
Mathematical models and decomposition algorithms for cutting and packing problems
M Delorme
4OR 16 (2), 229-230, 2018
42018
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20