On greedy approximation algorithms for a class of two-stage stochastic assignment problems
From MaRDI portal
Publication:5746684
DOI10.1080/10556788.2012.728216zbMath1282.90091OpenAlexW2061826697MaRDI QIDQ5746684
Serdar Karademir, Oleg A. Prokopyev, Nan Kong
Publication date: 7 February 2014
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.728216
Related Items (3)
Fast scenario reduction by conditional scenarios in two-stage stochastic MILP problems ⋮ Task preference-based bottleneck assignment problem ⋮ From scenarios to conditional scenarios in two‐stage stochastic MILP problems
Cites Work
- Unnamed Item
- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- Stochastic programming with integer variables
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Computational complexity of stochastic programming problems
- Exact solutions to a class of stochastic generalized assignment problems
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
- On the random 2-stage minimum spanning tree
- Lectures on Stochastic Programming
- Introduction to Stochastic Programming
- LP Rounding Approximation Algorithms for Stochastic Network Design
This page was built for publication: On greedy approximation algorithms for a class of two-stage stochastic assignment problems
