Bertrand Hellion

Un algorithme polynomial pour le problème de lot sizing mono-produit avec capacité et production minimale

Bernard Penz, Bertrand Hellion, Fabien Mangione, 2012 .

A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs

Bernard Penz, Bertrand Hellion, Fabien Mangione, 2012, Eur. J. Oper. Res..

A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows

Bernard Penz, Bertrand Hellion, Fabien Mangione, 2014, Oper. Res. Lett..

Lot Sizing mono-item multi-fournisseurs avec contraintes de volume et de régularité sur les commandes

Bernard Penz, Bertrand Hellion, Fabien Mangione, 2011 .

Corrigendum to "A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs" [Eur. J. Oper. Res. (2012) 10-16]

Bernard Penz, Bertrand Hellion, Fabien Mangione, 2013, Eur. J. Oper. Res..

Stability contracts between supplier and retailer: a new lot sizing model

Bernard Penz, Bertrand Hellion, Fabien Mangione, 2015 .

Stability contract for tactical planning in a supply chain : new lot sizing models

Bertrand Hellion, B. Hellion, 2013 .