Search Results - subject:"Submodular function"

Lattices and lotteries in apportioning risk

Schlesinger, Harris - In: The Geneva risk and insurance review 40 (2015) 1, pp. 1-14

Persistent link: https://www.econbiz.de/10011430670

Risk averse submodular utility maximization

Maehara, Takanori - In: Operations research letters 43 (2015) 5, pp. 526-529

Persistent link: https://www.econbiz.de/10011386462

A bilevel programming problem with maximization of a supermodular function in the lower level

Fanghänel, Diana - In: Journal of combinatorial optimization 26 (2013) 3, pp. 568-584

Persistent link: https://www.econbiz.de/10010204546

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

Blatz, John; Fishkind, Donniell; Priebe, Carey - In: Computational Statistics 72 (2010) 1, pp. 63-74

The problem that we consider here is a basic operations research problem, but it also a special case of the Stochastic Shortest Path with Recourse Problem and the Canadian Travellers Problem in the probabilistic path planning literature, and it is also a special case of maximizing a submodular...

Persistent link: https://www.econbiz.de/10010847629

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

Blatz, John; Fishkind, Donniell; Priebe, Carey - In: Mathematical Methods of Operations Research 72 (2010) 1, pp. 63-74

Persistent link: https://www.econbiz.de/10010950052

A strongly polynomial-time algorithm for minimizing submodular functions

IWATA, Satoru; FLEISCHER, Lisa; FUJISHIGE, Satoru - Center for Operations Research and Econometrics (CORE), … - 1999

algorithms for submodular function minimization that run in (strongly) polynomial time. …

Persistent link: https://www.econbiz.de/10005042940

Simultaneous Search

Smith, Lones; Chade, Hector - Society for Economic Dynamics - SED - 2004

recruits will be available with smaller probability. We show that this problem entails maximizing a submodular function of …

Persistent link: https://www.econbiz.de/10005051431

simultaneous search

smith, lones; chade, hector - Econometric Society - 2004

recruits will be available with smaller probability. We show that this problem entails maximizing a submodular function of …

Persistent link: https://www.econbiz.de/10005342200