Addressing the most reliable edge-disjoint paths with a delay constraint
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
IEEE
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/49558 |
| _version_ | 1848758265645629440 |
|---|---|
| author | Loh, Rue-chze Soh, Sie Teng Lazarescu, Mihai |
| author_facet | Loh, Rue-chze Soh, Sie Teng Lazarescu, Mihai |
| author_sort | Loh, Rue-chze |
| building | Curtin Institutional Repository |
| collection | Online Access |
| first_indexed | 2025-11-14T09:41:15Z |
| format | Journal Article |
| id | curtin-20.500.11937-49558 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:41:15Z |
| publishDate | 2011 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-495582018-12-14T00:51:31Z Addressing the most reliable edge-disjoint paths with a delay constraint Loh, Rue-chze Soh, Sie Teng Lazarescu, Mihai network reliability multi-constrained edge-disjoint paths network delay lagrange relaxation approximate algorithm 2011 Journal Article http://hdl.handle.net/20.500.11937/49558 IEEE restricted |
| spellingShingle | network reliability multi-constrained edge-disjoint paths network delay lagrange relaxation approximate algorithm Loh, Rue-chze Soh, Sie Teng Lazarescu, Mihai Addressing the most reliable edge-disjoint paths with a delay constraint |
| title | Addressing the most reliable edge-disjoint paths with a delay constraint |
| title_full | Addressing the most reliable edge-disjoint paths with a delay constraint |
| title_fullStr | Addressing the most reliable edge-disjoint paths with a delay constraint |
| title_full_unstemmed | Addressing the most reliable edge-disjoint paths with a delay constraint |
| title_short | Addressing the most reliable edge-disjoint paths with a delay constraint |
| title_sort | addressing the most reliable edge-disjoint paths with a delay constraint |
| topic | network reliability multi-constrained edge-disjoint paths network delay lagrange relaxation approximate algorithm |
| url | http://hdl.handle.net/20.500.11937/49558 |