Monte Carlo tree search for dynamic shortest-path interdiction

DOI10.1002/net.22243MaRDI QIDQ6659083

Unnamed Author, J. Cole Smith

Publication date: 8 January 2025

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

heuristicsshortest pathgamesalpha-beta pruningMonte Carlo tree searchinterdiction

Mathematics Subject Classification ID

Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites Work

• Unnamed Item
• Perspectives of approximate dynamic programming
• Partitioning procedures for solving mixed-variables programming problems
• An analysis of alpha-beta pruning
• A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Network interdiction with asymmetric cost uncertainty
• A survey of network interdiction models and algorithms
• Survivable network design under optimal and heuristic interdiction scenarios
• Reinforcement learning for combinatorial optimization: a survey
• Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
• Julia: A Fresh Approach to Numerical Computing
• Approximate Dynamic Programming
• Shortest path network interdiction with asymmetric information
• What you should know about approximate dynamic programming
• Maximizing the minimum source-sink path subject to a budget constraint
• Securing a border under asymmetric information
• Dynamic shortest‐path interdiction
• Deception tactics for network interdiction: A multiobjective approach
• Shortest-path network interdiction
• Random Graphs
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: Monte Carlo tree search for dynamic shortest-path interdiction