Efficient, optimal stochastic-action selection when limited by an action budget

DOI10.1007/S00186-010-0305-6zbMath1211.93134OpenAlexW2113451815MaRDI QIDQ5962147

Donniell E. Fishkind, Carey E. Priebe, John Blatz

Publication date: 21 September 2010

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-010-0305-6

zbMATH Keywords

submodular functionCanadian travellers problemmatroid constraint

Mathematics Subject Classification ID

Stochastic programming (90C15) Optimal stochastic control (93E20) Control/observation systems in abstract spaces (93C25)

Related Items (1)

Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest paths without a map
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• Stochastic shortest paths with recourse
• An analysis of approximations for maximizing submodular set functions—I
• A polynomial-time algorithm to find shortest paths with recourse
• Stochastic shortest path problems with recourse

This page was built for publication: Efficient, optimal stochastic-action selection when limited by an action budget