The Periodic Capacitated Arc Routing Problem: linear programming model, metaheuristic and lower bound - Université de technologie de Troyes Access content directly
Conference Papers Year : 2004

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

No file

Dates and versions

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

Identifiers

  • HAL Id : hal-02736455 , version 1

Cite

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 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More