Cargando…
Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
Many security companies offer patrolling services, such that guards inspect facilities or streets on a regular basis. Patrolling routes should be cost efficient, but the inspection patterns should not be predictable for offenders. We introduce this setting as a multi‐objective periodic mixed capacit...
Autores principales: | Fröhlich, Georg E. A., Doerner, Karl F., Gansterer, Margaretha |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
John Wiley & Sons, Inc.
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7702082/ https://www.ncbi.nlm.nih.gov/pubmed/33328694 http://dx.doi.org/10.1002/net.21993 |
Ejemplares similares
-
The cost of incentive compatibility in auction‐based mechanisms for carrier collaboration
por: Gansterer, Margaretha, et al.
Publicado: (2018) -
Graphing trillions of triangles
por: Burkhardt, Paul
Publicado: (2016) -
A simple interpretation of undirected edges in essential graphs is wrong
por: Kummerfeld, Erich
Publicado: (2021) -
Graph‐based optimization of epitope coverage for vaccine antigen design
por: Theiler, James, et al.
Publicado: (2017) -
Creating effective interrupted time series graphs: Review and recommendations
por: Turner, Simon L., et al.
Publicado: (2020)