Paolo Gianessi
Paolo Gianessi
Assistant Professor at LIMOS - Mines Saint-Étienne, France
Adresse e-mail validée de emse.fr
TitreCitée parAnnée
The multicommodity-ring location routing problem
P Gianessi, L Alfandari, L Létocart, R Wolfler Calvo
Transportation Science 50 (2), 541-558, 2015
192015
Energy-aware service provisioning in volunteers clouds.
Y Ngoko, C Cérin, P Gianessi, C Jiang
IJBDI 2 (4), 262-284, 2015
132015
Towards energy efficient allocation for applications in volunteer cloud
C Jiang, J Wan, C Cérin, P Gianessi, Y Ngoko
2014 IEEE International Parallel & Distributed Processing Symposium …, 2014
62014
Solving strategic and tactical optimization problems in city logistics
P Gianessi
52014
A column generation based heuristic for the multicommodity-ring vehicle routing problem
P Gianessi, L Alfandari, L Létocart, RW Calvo
Transportation Research Procedia 12, 227-238, 2016
22016
Modeling energy savings in volunteers clouds
C Jian, J Wan, C Cérin, P Gianessi, Y Ngoko
2013 International Conference on Cloud Computing and Big Data, 52-59, 2013
22013
Job-shop scheduling problem with energy consideration
O Masmoudi, X Delorme, P Gianessi
International Journal of Production Economics 216, 12-22, 2019
12019
Solving network design and routing problems for urban freight distribution
P Gianessi, L Alfandari, L Létocart, RW Calvo
Proceedings of the 5th International Workshop on Freight Transport and …, 2012
12012
Intégration du Rest Allowance dans l’ordonnancement d’ateliers de types Job-shop
D Lamy, A Cerqueus, S Finco, P Gianessi
2019
LP models for the job-shop scheduling problem with energy consideration
P Gianessi, O Masmoudi, X Delorme
2018
Ordonnancement d’un atelier de type job-shop avec considération énergétique
O Masmoudi, X Delorme, P Gianessi
2018
A Branch&Cut algorithm for the Multi-Trip Vehicle Routing Problem with Time Windows
D Cattaruzza, P Gianessi
2017
A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities
P Gianessi, A Ceselli, L Létocart, RW Calvo
Electronic Notes in Discrete Mathematics 55, 93-96, 2016
2016
A Branch&Cut algorithm for the Multi-Trip Vehicle Routing Problem with Time Windows
P Gianessi, D Cattaruzza
2016
A Branch&Price&Cut approach for the Vehicle Routing Problem with Intermediate Replenishment Facilities
L Létocart, P Gianessi, A Ceselli, RW Calvo
2016
Optimisation Stratégique et tactique en logistique urbaine
P Gianessi
Paris 13, 2014
2014
New Branch&Cut Approaches for the Vehicle Routing Problem with Intermediate Replenishment Facilities
P Gianessi, L Létocart, RW Calvo
2014
Go to section...
B Han
Computational comparison of different stabilization methods in Column Generation
F Furini, P Gianessi
Planification et routage pour l’optimisation de la distribution urbaine de marchandises
L Alfandari, P Gianessi, L Létocart, RW Calvo
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20