Volgen
Maxime Ogier
Maxime Ogier
Centrale Lille
Geverifieerd e-mailadres voor centralelille.fr
Titel
Geciteerd door
Geciteerd door
Jaar
An efficient and general approach for the joint order batching and picker routing problem
O Briant, H Cambazard, D Cattaruzza, N Catusse, AL Ladier, M Ogier
European Journal of Operational Research 285 (2), 497-512, 2020
712020
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
Y Yuan, D Cattaruzza, M Ogier, F Semet
European Journal of Operational Research 286 (3), 849-866, 2020
512020
Adaptive large neighborhood search for the commodity constrained split delivery VRP
W Gu, D Cattaruzza, M Ogier, F Semet
Computers & Operations Research 112, 104761, 2019
492019
A column generation based heuristic for the generalized vehicle routing problem with time windows
Y Yuan, D Cattaruzza, M Ogier, F Semet, D Vigo
Transportation Research Part E: Logistics and Transportation Review 152, 102391, 2021
422021
Decentralised planning coordination with quantity discount contract in a divergent supply chain
M Ogier, VD Cung, J Boissière, SH Chung
International Journal of Production Research 51 (9), 2776-2789, 2013
342013
A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for routing problems with time windows
Y Yuan, D Cattaruzza, M Ogier, F Semet
Operations Research Letters 48 (2), 167-169, 2020
252020
Decentralised capacitated planning with minimal-information sharing in a 2-echelon supply chain
M Ogier, FTS Chan, SH Chung, VD Cung, J Boissière
International journal of production research 53 (16), 4927-4950, 2015
192015
Service network design in short and local fresh food supply chain∗
M Ogier, VD Cung, J Boissière
RAIRO-Operations Research 47 (4), 445-464, 2013
192013
A sequential approach for a multi-commodity two-echelon distribution problem
W Gu, C Archetti, D Cattaruzza, M Ogier, F Semet, MG Speranza
Computers & Industrial Engineering 163, 107793, 2022
182022
A two-phase approach for an integrated order batching and picker routing problem
M Bué, D Cattaruzza, M Ogier, F Semet
A View of Operations Research Applications in Italy, 2018, 3-18, 2019
11*2019
A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on Inventory Routing
N Absi, D Cattaruzza, D Feillet, M Ogier, F Semet
Transportation Science 54 (2), 313-329, 2020
102020
Supply chain performance in the case of decentralized planning
M Ogier, VD Cung, F Mangione, J Boissiere
2010 8th International Conference on Supply Chain Management and Information …, 2010
82010
Mixed integer programming formulations for the generalized traveling salesman problem with time windows
Y Yuan, D Cattaruzza, M Ogier, C Rousselot, F Semet
4OR 19, 571-592, 2021
72021
Collaborative and multilevel optimizations of a hybrid railway power substation
S Brisset, M Ogier
International Journal of Numerical Modelling: Electronic Networks, Devices …, 2019
72019
Comparison of cycle reduction and model reduction strategies for the design optimization of hybrid powertrains on driving cycles
A Kaloun, S Brisset, M Ogier, M Ahmed, R Vincent
Energies 14 (4), 948, 2021
62021
The generalized vehicle routing problem with time windows
Y Yuan, D Cattaruzza, M Ogier, F Semet, D Vigo
ROADEF 2019-20ème congrès annuel de la Société Française de Recherche …, 2019
42019
The last mile delivery problem
Y Yuan, D Cattaruzza, M Ogier, F Semet
International workshop on vehicle routing, intermodal transportation and …, 2018
42018
An improved planning coordination in a decentralized 2-echelon supply chain
M Ogier, VD Cung, J Boissière
4th International Conference on Information Systems, Logistics and Supply …, 2012
42012
Contributions à la chaine logistique numérique: conception de circuits courts et planification décentralisée.
M Ogier
Université de Grenoble, 2013
32013
Development of a sustainable Supply Chain Planning tool coupling simulation and optimization techniques
M Ogier, VD Cung, J Boissière
International Workshop on Green Supply Chain (GSC), 1-4, 2012
32012
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20