scientific article; zbMATH DE number 1175949
From MaRDI portal
Publication:4398366
Cited in
(14)- Dual decomposition in stochastic integer programming
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- Evolution and state-of-the-art in integer programming
- A two-echelon stochastic facility location model for humanitarian relief logistics
- Totally unimodular stochastic programs
- Convex approximations for a class of mixed-integer recourse models
- Online stochastic optimization under time constraints
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- Computational complexity of stochastic programming problems
- The million-variable ``march for stochastic combinatorial optimization
- Exact solutions to a class of stochastic generalized assignment problems
- Simple integer recourse models: convexity and convex approximations
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- Two-stage stochastic mixed-integer programs: algorithms and insights
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398366)