An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs (Q975758)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs |
scientific article |
Statements
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs (English)
0 references
11 June 2010
0 references
OR in telecommunications
0 references
paths with minimal cost sum
0 references
0 references
