Solving the shortest edge disjoint or capacited undirected paths problems

Abstract : resume
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01124527
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 10:38:16 AM
Last modification on : Saturday, February 9, 2019 - 1:24:19 AM

Identifiers

  • HAL Id : hal-01124527, version 1

Collections

Citation

Marie-Christine Costa, N. P?letan. Solving the shortest edge disjoint or capacited undirected paths problems. Int. Symp. on Mathematical Programming (ISPM 97), Lausanne, Jan 1997, X, France. ⟨hal-01124527⟩

Share

Metrics

Record views

23