default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaxence Delorme
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j19]Mathijs Barkel
, Maxence Delorme, Enrico Malaguti, Michele Monaci:
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation. Eur. J. Oper. Res. 320(1): 57-68 (2025)- 2024
- [j18]Giulia Caselli, Maxence Delorme, Manuel Iori, Carlo Alberto Magni:
Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints. Comput. Oper. Res. 163: 106484 (2024) - [j17]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson:
New Algorithms for Hierarchical Optimization in Kidney Exchange Programs. Oper. Res. 72(4): 1654-1673 (2024) - 2023
- [j16]Mathijs Barkel, Maxence Delorme:
Arcflow Formulations and Constraint Generation Frameworks for the Two Bar Charts Packing Problem. INFORMS J. Comput. 35(2): 475-494 (2023) - [j15]Maxence Delorme, David F. Manlove, Tom Smeets:
Half-cycle: A new formulation for modelling kidney exchange problems. Oper. Res. Lett. 51(3): 234-241 (2023) - 2022
- [j14]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson, James Trimble:
Improved instance generation for kidney exchange programmes. Comput. Oper. Res. 141: 105707 (2022) - [j13]Giulia Caselli, Maxence Delorme, Manuel Iori:
Integer Linear Programming for the Tutor Allocation Problem: A practical case in a British University. Expert Syst. Appl. 187: 115967 (2022) - 2021
- [j12]William Pettersson, Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove:
Improving solution times for stable matching problems through preprocessing. Comput. Oper. Res. 128: 105128 (2021) - [j11]Maxence Delorme, Manuel Iori, Nilson F. M. Mendes:
Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events. Eur. J. Oper. Res. 295(3): 823-837 (2021) - [c2]Giulia Caselli, Daniele De Santis, Maxence Delorme, Manuel Iori:
A Mathematical Formulation for Reducing Overcrowding in Hospitals' Waiting Rooms. IEEM 2021: 297-301 - 2020
- [j10]John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer, Nico Strasdat:
Improved flow-based formulations for the skiving stock problem. Comput. Oper. Res. 113 (2020) - [j9]Maxence Delorme, Manuel Iori:
Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems. INFORMS J. Comput. 32(1): 101-119 (2020) - [i2]Giulia Caselli, Maxence Delorme, Manuel Iori:
Integer Linear Programming for the Tutor Allocation Problem: A Practical Case in a British University. CoRR abs/2005.09442 (2020)
2010 – 2019
- 2019
- [j8]Mauro Dell'Amico, Maxence Delorme, Manuel Iori, Silvano Martello:
Mathematical models and decomposition methods for the multiple knapsack problem. Eur. J. Oper. Res. 274(3): 886-899 (2019) - [j7]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson:
Mathematical models for stable matching problems with ties and incomplete lists. Eur. J. Oper. Res. 277(2): 426-441 (2019) - 2018
- [j6]Maxence Delorme:
Mathematical models and decomposition algorithms for cutting and packing problems. 4OR 16(2): 229-230 (2018) - [j5]Vitor Nesello, Maxence Delorme, Manuel Iori, Anand Subramanian:
Mathematical models and decomposition algorithms for makespan minimization in plastic rolls production. J. Oper. Res. Soc. 69(3): 326-339 (2018) - [j4]Maxence Delorme, Manuel Iori, Silvano Martello:
BPPLIB: a library for bin packing and cutting stock problems. Optim. Lett. 12(2): 235-250 (2018) - [c1]John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer:
An Improved Arcflow Model for the Skiving Stock Problem. OR 2018: 135-141 - [i1]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson:
Mathematical models for stable matching problems with ties and incomplete lists. CoRR abs/1810.02711 (2018) - 2017
- [b1]Maxence Delorme:
Mathematical Models and Decomposition Algorithms for Cutting and Packing Problems. University of Bologna, Italy, 2017 - [j3]Gianluca Costa, Maxence Delorme, Manuel Iori, Enrico Malaguti, Silvano Martello:
Training software for orthogonal packing problems. Comput. Ind. Eng. 111: 139-147 (2017) - [j2]Maxence Delorme, Manuel Iori, Silvano Martello:
Logic based Benders' decomposition for orthogonal stock cutting problems. Comput. Oper. Res. 78: 290-298 (2017) - 2016
- [j1]Maxence Delorme, Manuel Iori, Silvano Martello:
Bin packing and cutting stock problems: Mathematical models and exact algorithms. Eur. J. Oper. Res. 255(1): 1-20 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
