The Periodic Capacitated Arc Routing Problem: linear programming model, metaheuristic and lower bound - Université de technologie de Troyes Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

The Periodic Capacitated Arc Routing Problem: linear programming model, metaheuristic and lower bound

Fichier non déposé

Dates et versions

hal-02736455 , version 1 (02-06-2020)

Identifiants

  • HAL Id : hal-02736455 , version 1

Citer

Feng Chu, Nacima Labadie, Christian Prins. The Periodic Capacitated Arc Routing Problem: linear programming model, metaheuristic and lower bound. ICSSSM 2004 (Int. Conf. on Service Systems and Service Management), Jul 2004, Pékin, China. ⟨hal-02736455⟩

Collections

CNRS UTT LOSI
10 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More