|
 
|
[BCP07] The shortest multipaths problem in a capacitated dense channel
Revue Internationale avec comité de lecture : Journal European Journal of Operational Research, vol. 178(3), pp. 926-931, 2007, (doi:10.1016/j.ejor.2006.03.007)
motcle:
Résumé:
In this paper, we present a simple polynomial-time algorithm
solving the shortest multipaths problem in particular grid graphs
called dense channels. Our work extends the results of Formann et al. [M. Formann, D. Wagner and F. Wagner. Routing through a dense channel with minimum total wire length. Journal of Algorithms 15 (1993) 267-283], by considering arbitrary horizontal and vertical capacities.
BibTeX
| @article { | |||
| BCP07, | |||
| title | = | "{The shortest multipaths problem in a capacitated dense channel}", | |
| author | = | "C. Bentz and M.-C. Costa and C. Picouleau and M. Zrikem", | |
| journal | = | "European Journal of Operational Research", | |
| year | = | 2007, | |
| volume | = | 178, | |
| number | = | 3, | |
| pages | = | "926-931", | |
| doi | = | "10.1016/j.ejor.2006.03.007", | |
| } | |||
