( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Logic based Benders' decomposition for orthogonal stock cutting problems.

, , и . Comput. Oper. Res., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Maxence Delorme

Heiko Delorme

Maxence Vandenbroucke

Maxime Delorme

Peter Delorme

 

Другие публикации лиц с тем же именем

Improved instance generation for kidney exchange programmes., , , , , , и . Comput. Oper. Res., (2022)Mathematical models for stable matching problems with ties and incomplete lists., , , , , и . Eur. J. Oper. Res., 277 (2): 426-441 (2019)Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events., , и . Eur. J. Oper. Res., 295 (3): 823-837 (2021)Mathematical models and decomposition methods for the multiple knapsack problem., , , и . Eur. J. Oper. Res., 274 (3): 886-899 (2019)Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems., и . INFORMS J. Comput., 32 (1): 101-119 (2020)An Improved Arcflow Model for the Skiving Stock Problem., , , и . OR, стр. 135-141. Springer, (2018)Improving solution times for stable matching problems through preprocessing., , , , , и . Comput. Oper. Res., (2021)A Mathematical Formulation for Reducing Overcrowding in Hospitals' Waiting Rooms., , , и . IEEM, стр. 297-301. IEEE, (2021)Integer Linear Programming for the Tutor Allocation Problem: A Practical Case in a British University., , и . CoRR, (2020)Integer Linear Programming for the Tutor Allocation Problem: A practical case in a British University., , и . Expert Syst. Appl., (2022)