An Effective Algorithm for Obtaining the Minimal Cost Pair of Disjoint Paths with Dual Arc Costs

AuthID
 P-003-K8Z
3
Author(s)
Document Type
Article
Year published
2009
Published
in COMPUTERS & OPERATIONS RESEARCH, ISSN: 0305-0548
Volume: 36, Issue: 5, Pages: 1670-1682 (13)
Indexing
Wos®
Scopus®
Crossref®
Google Scholar®
Publication Identifiers
SCOPUS: 2-s2.0-55749105565
Wos: WOS:000262882500028
Source Identifiers
ISSN: 0305-0548
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service