Erratum to: ``Computational complexity of stochastic programming problems
From MaRDI portal
Erratum to: ``Computational complexity of stochastic programming problems''
Recommendations
- Corrigendum to: ``A scenario decomposition algorithm for 0--1 stochastic programs
- A comment on ``Computational complexity of stochastic programming problems
- Corrigendum: Lagrange Multipliers in Stochastic Programming
- Note—Erratum: A Computational Error in a Nonlinear Programming Example
- Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
Cited in
(24)- Erratum to: ``Linear programming models for a stochastic dynamic capacitated lot sizing problem
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- Erratum to: ``An abstract model for branching and its application to mixed integer programming
- Corrigendum to: ``A scenario decomposition algorithm for 0--1 stochastic programs
- Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem
- Erratum: A correction to Parallel approximation algorithms by positive linear programming
- Correction to: ``Complexity of stochastic dual dynamic programming
- Correction to: ``Parallel and distributed computing for stochastic dual dynamic programming
- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Erratum to: ``An approximation algorithm for the \(k\)-level stochastic facility location problem
- Erratum to: ``A copula-based heuristic for scenario generation
- A note on ``Tactical berth allocation under uncertainty
- Submodular reassignment problem for reallocating agents to tasks with synergy effects
- A commentary on ``Hybrid search for minimal perturbation in dynamic CSPs
- Erratum: Probabilistic models for linear programming
- Erratum: Lot-sizing with stock upper bounds and fixed charges
- A comment on ``Computational complexity of stochastic programming problems
- Note—Erratum: A Computational Error in a Nonlinear Programming Example
- Corrigendum: Lagrange Multipliers in Stochastic Programming
- Publisher's note
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- Corrigendum to ``Solving equations via the trust region and its application to a class of stochastic linear complementarity problems [Comput. Math. Appl. 61 (2011) 1646-1664]
- Correction to: ``The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
This page was built for publication: Erratum to: ``Computational complexity of stochastic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747782)
