The Periodic Capacitated Arc Routing Problem: linear programming model, metaheuristic and lower bound - Archive ouverte HAL Access content directly
Conference Papers Year :

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

(1) , (1) , (1)
1
Feng Chu
  • Function : Author
  • PersonId : 876502
Laboratoire d'Optimisation des Systèmes Industriels
Nacima Labadie
  • Function : Author
  • PersonId : 952673
Laboratoire d'Optimisation des Systèmes Industriels
Christian Prins
  • Function : Author
  • PersonId : 952560
Laboratoire d'Optimisation des Systèmes Industriels

Domains

Computer Science [cs] Operations Research [cs.RO]

Jean-Baptiste VU VAN  : Connect in order to contact the contributor

https://hal-utt.archives-ouvertes.fr/hal-02736455

Submitted on : Tuesday, June 2, 2020-5:45:38 PM

Last modification on : Sunday, June 26, 2022-1:40:52 AM

Not 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⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS UTT LOSI
8 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More