Maxime Ogier
Orcid: 0000-0002-8503-7632
According to our database1,
Maxime Ogier
authored at least 10 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Eur. J. Oper. Res., 2024
Home chemotherapy delivery: An integrated production scheduling and multi-trip vehicle routing problem.
Eur. J. Oper. Res., 2024
2022
Comput. Ind. Eng., 2022
2021
Mixed integer programming formulations for the generalized traveling salesman problem with time windows.
4OR, 2021
2020
A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing.
Transp. Sci., 2020
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows.
Oper. Res. Lett., 2020
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows.
Eur. J. Oper. Res., 2020
An efficient and general approach for the joint order batching and picker routing problem.
Eur. J. Oper. Res., 2020
2019
Comput. Oper. Res., 2019
2013
RAIRO Oper. Res., 2013