A branch-and-cut algorithm for the two-echelon location-routing problem - Université de technologie de Troyes Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

A branch-and-cut algorithm for the two-echelon location-routing problem

Fichier non déposé

Dates et versions

hal-02890048 , version 1 (06-07-2020)

Identifiants

  • HAL Id : hal-02890048 , version 1

Citer

Viet-Phuong Nguyen, Christian Prins, Caroline Prodhon, Juan Villegas. A branch-and-cut algorithm for the two-echelon location-routing problem. Odysseus (5th International Workshop on Freight Transportation and Logistics), May 2012, Mykonos, Greece. ⟨hal-02890048⟩

Collections

CNRS UTT LOSI
10 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More