On Optimal Allocation of Indivisibles Under Uncertainty
From MaRDI portal
Publication:2781102
DOI10.1287/opre.46.3.381zbMath0987.90064MaRDI QIDQ2781102
Ruszczyński, Andrzej, Vladimir I. Norkin, Yury M. Ermoliev
Publication date: 18 March 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/067f45fb52eb69371f26e41e7f196e08ec643771
Related Items
On the role of bounds in stochastic linear programming, Discrete stochastic optimization using variants of the stochastic ruler method, Recent trends in metaheuristics for stochastic combinatorial optimization, B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty, Reliability optimization of a complex system by the stochastic branch and bound method, Solving knapsack problems with \(S\)-curve return functions, Optimization of R\&D project portfolios under endogenous uncertainty, A survey on metaheuristics for stochastic combinatorial optimization, A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling, A branch and bound method for stochastic global optimization, Convex approximations for complete integer recourse models, Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound, Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand, Convex approximations for a class of mixed-integer recourse models, Enriched workflow modelling and stochastic branch-and-bound, A stochastic programming approach for supply chain network design under uncertainty, Exact solutions to a class of stochastic generalized assignment problems, Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, Minorant methods of stochastic global optimization
