On greedy approximation algorithms for a class of two-stage stochastic assignment problems

Author： Karademir Serdar   Kong Nan   Prokopyev Oleg A.  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.29, Iss.1, 2014-01, pp. : 42-67

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Simultaneous approximation by greedy algorithms

By Leviatan D.   Temlyakov V.  

Advances in Computational Mathematics, Vol. 25, Iss. 1-3, 2006-07 ,pp. : 73-90

Springer Publishing Company

Access to resources Recommend Favorite

Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs

By Gade Dinakar   Küçükyavuz Simge   Sen Suvrajeet  

Mathematical Programming, Vol. 144, Iss. 1-2, 2014-04 ,pp. : 39-64

Elsevier

Access to resources Recommend Favorite

The best m-term approximation and greedy algorithms

By Temlyakov V.N.  

Advances in Computational Mathematics, Vol. 8, Iss. 3, 1998-04 ,pp. : 249-265

Springer Publishing Company

Access to resources Recommend Favorite

Sampling average approximation method for a class of stochastic Nash equilibrium problems

By Li Pei-Yu  

Optimization Methods and Software, Vol. 28, Iss. 4, 2013-08 ,pp. : 785-795

Taylor & Francis Ltd

Access to resources Recommend Favorite

Two-Stage Nested Partitions Method for Stochastic Optimization

By Ólafsson Sigurdur  

Methodology And Computing In Applied Probability, Vol. 6, Iss. 1, 2004-03 ,pp. : 5-27

Springer Publishing Company

Access to resources Recommend Favorite