Results: 6
Improved approximation algorithms for some min–max postmen cover problems with applications to the min–max subtree cover.
- Published in:
- Mathematical Methods of Operations Research, 2023, v. 97, n. 1, p. 135, doi. 10.1007/s00186-022-00807-8
- By:
- Publication type:
- Article
An axiomatic approach to Markov decision processes.
- Published in:
- Mathematical Methods of Operations Research, 2023, v. 97, n. 1, p. 117, doi. 10.1007/s00186-022-00806-9
- By:
- Publication type:
- Article
An implicit gradient-descent procedure for minimax problems.
- Published in:
- Mathematical Methods of Operations Research, 2023, v. 97, n. 1, p. 57, doi. 10.1007/s00186-022-00805-w
- By:
- Publication type:
- Article
Nash equilibria for relative investors via no-arbitrage arguments.
- Published in:
- Mathematical Methods of Operations Research, 2023, v. 97, n. 1, p. 1, doi. 10.1007/s00186-022-00804-x
- By:
- Publication type:
- Article
Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising.
- Published in:
- Mathematical Methods of Operations Research, 2023, v. 97, n. 1, p. 25, doi. 10.1007/s00186-022-00803-y
- By:
- Publication type:
- Article
Markov risk mappings and risk-sensitive optimal prediction.
- Published in:
- Mathematical Methods of Operations Research, 2023, v. 97, n. 1, p. 91, doi. 10.1007/s00186-022-00802-z
- By:
- Publication type:
- Article