Maxime Ogier

Orcid: 0000-0002-8503-7632

According to our database1, Maxime Ogier authored at least 8 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A sequential approach for a multi-commodity two-echelon distribution problem.
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
Adaptive large neighborhood search for the commodity constrained split delivery VRP.
Comput. Oper. Res., 2019

2013
Service network design in short and local fresh food supply chain.
RAIRO Oper. Res., 2013


  Loading...