Approximation Algorithms for a Class of Stochastic Selection Problems With Reward and Cost Considerations

Operations Research - United States
doi 10.1287/opre.2017.1696
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

An Approximation Scheme for a Class of Risk-Averse Stochastic Equilibrium Problems

Mathematical Programming, Series B
MathematicsSoftware
2016English

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

2009English

Improved Approximation Results for Stochastic Knapsack Problems

2011English

Rollout Algorithms for Stochastic Scheduling Problems

English

Approximation Algorithms for Partial Covering Problems*1

Journal of Algorithms
2004English

Fast Approximation Algorithms for Multicommodity Flow Problems

1991English

Structural and Statistical Problems for a Class of Stochastic Processes

1971English

Convergence Results for Ant Routing Algorithms via Stochastic Approximation

ACM Transactions on Autonomous and Adaptive Systems
ControlSystems EngineeringComputer ScienceSoftware
2013English

Approximation Algorithms for Multi-Dimensional Vector Assignment Problems

SSRN Electronic Journal
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy