Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
From MaRDI portal
Publication:3087850
DOI10.1111/j.1475-3995.2010.00766.xzbMath1219.90176OpenAlexW1965956451MaRDI QIDQ3087850
Luís Gouveia, Pedro Patrício, Amaro de Sousa
Publication date: 17 August 2011
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2010.00766.x
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Traffic problems in operations research (90B20)
Related Items (3)
Layered graph approaches for combinatorial optimization problems ⋮ On a relaxed maximally disjoint path pair problem: a bicriteria approach ⋮ The travelling salesman problem with positional consistency constraints: an application to healthcare services
Cites Work
This page was built for publication: Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models