An optimal hostage rescue problem.

DOI10.1016/S0377-2217(02)00602-1MaRDI QIDQ1406956zbMATH OpenFDO

Authors Fengbo Shi

Publication date 7 September 2003

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2241/663

zbMATH Keywords

Dynamic programmingHostage rescueStochastic processes

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Dynamic programming (90C39)

Recommendations

• OPTIMAL HOSTAGE RESCUE PROBLEM WHERE AN ACTION CAN ONLY BE TAKEN ONCE : CASE WHERE ITS EFFECTIVENESS VANISHES THEREAFTER
• The Maximum Capture Problem Including Relocation
• An optimal matching problem
• The optimal rescue path set problem in undirected graphs
• scientific article; zbMATH DE number 194322
• Solving a family of simple allocation problems.
• On a problem of optimal searching.
• An optimal assignment problem with choice strategy
• An optimization problem

Cited in

(1)

• OPTIMAL HOSTAGE RESCUE PROBLEM WHERE AN ACTION CAN ONLY BE TAKEN ONCE : CASE WHERE ITS EFFECTIVENESS VANISHES THEREAFTER

This page was built for publication: An optimal hostage rescue problem.

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