The following pages link to (Q4398366):
Displaying 14 items.
- Dual decomposition in stochastic integer programming (Q1306366) (← links)
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308) (← links)
- Evolution and state-of-the-art in integer programming (Q1593833) (← links)
- A two-echelon stochastic facility location model for humanitarian relief logistics (Q1758057) (← links)
- Totally unimodular stochastic programs (Q1949257) (← links)
- Convex approximations for a class of mixed-integer recourse models (Q1958624) (← links)
- Online stochastic optimization under time constraints (Q1958625) (← links)
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights (Q2448903) (← links)
- Computational complexity of stochastic programming problems (Q2492669) (← links)
- The million-variable ``march'' for stochastic combinatorial optimization (Q2494291) (← links)
- Exact solutions to a class of stochastic generalized assignment problems (Q2496071) (← links)
- Simple integer recourse models: convexity and convex approximations (Q2502210) (← links)
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables (Q2502216) (← links)
- Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights (Q3565463) (← links)
