The shortest multipaths problem in a capacitated dense channel

The shortest multipaths problem in a capacitated dense channel

0.00 Avg rating0 Votes
Article ID: iaor2009627
Country: Netherlands
Volume: 178
Issue: 3
Start Page Number: 926
End Page Number: 931
Publication Date: May 2007
Journal: European Journal of Operational Research
Authors: , ,
Keywords: combinatorial optimization, graphs
Abstract:

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., by considering arbitrary horizontal and vertical capacities.

Reviews

Required fields are marked *. Your email address will not be published.