Security routing games with multivehicle Chinese postman problem

DOI10.1002/NET.21563zbMATH Open1390.90167OpenAlexW2118834450MaRDI QIDQ4642467FDOQ4642467

Fernando Ordóñez, Dorit S. Hochbaum, Cheng Lyu

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21563

Recommendations

• On games arising from multi-depot Chinese postman problems
• Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
• The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
• On dynamic patrolling security games
• The secure time-dependent vehicle routing problem with uncertain demands
• On the core of routing games
• Improved solutions for the Chinese postman problem on mixed networks
• Algorithms for the Chinese postman problem on mixed networks
• scientific article; zbMATH DE number 4211828

zbMATH Keywords

approximation algorithmvehicle routingChinese postmansecurity gamesadversarial games

Mathematics Subject Classification ID

Cooperative games (91A12) Communication networks in operations research (90B18)

Cited In (8)

• Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
• Optimizing periodic patrols against short attacks on the line and other networks
• An updated annotated bibliography on arc routing problems
• Coordinating resources in Stackelberg security games
• Patrolling a Border
• Adversarial Patrolling in a Uniform
• Continuous Patrolling Games
• Approximation algorithms for the min-max mixed rural postmen cover problem and its variants

This page was built for publication: Security routing games with multivehicle Chinese postman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642467)