Referenced Items are not available for this document.
We propose six new heuristics to find a source-to-destination path that satisfies two or more additive constraints on edge weights. Five of these heuristics become ε-approximation algorithms when their parameters are appropriately set. The performance of our new heuristics is compared experimentally with that of two recently proposed heuristics for the same problem.
Published in:
Computers, IEEE Transactions on
(Volume:55
,
Issue:
5
)
Date of Publication: May 2006
- Page(s):
- 603 - 617
- ISSN :
- 0018-9340
- INSPEC Accession Number:
- 8918437
- Digital Object Identifier :
- 10.1109/TC.2006.67
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 03 April 2006
- Issue Date :
- May 2006
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
