Exact solutions to a class of stochastic generalized assignment problems
From MaRDI portal
Publication:2496071
DOI10.1016/j.ejor.2005.01.035zbMath1113.90082OpenAlexW2070561923MaRDI QIDQ2496071
Maarten H. van der Vlerk, Elena Fernández, Maria Albareda-Sambola
Publication date: 30 June 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://edoc.hu-berlin.de/18452/8920
Related Items
The probabilistic travelling salesman problem with crowdsourcing, Supply capacity acquisition and allocation with uncertain customer demands, A Survey of the Generalized Assignment Problem and Its Applications, The stochastic programming heritage of Maarten van der Vlerk, Scenario-based learning for stochastic combinatorial optimisation, On greedy approximation algorithms for a class of two-stage stochastic assignment problems, The double exponential runtime is tight for 2-stage stochastic ILPs, The double exponential runtime is tight for 2-stage stochastic ILPs, Improving the Integer L-Shaped Method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- R \& D planning and the generalized assignment problem
- Models and exact solutions for a class of stochastic location-routing problems
- A survey of algorithms for the generalized assignment problem
- Stochastic integer programming: general models and algorithms
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Dual decomposition in stochastic integer programming
- Stochastic programming with simple integer recourse
- Convex approximations for complete integer recourse models
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- An algorithm for the construction of convex hulls in simple integer recourse programming
- A branch-and-cut method for 0-1 mixed convex programming
- Addressing capacity uncertainty in resource-constrained assignment problems
- On Optimal Allocation of Indivisibles Under Uncertainty
- Continuity Properties of Expectation Functions in Stochastic Integer Programming
- Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
- Two stage linear programming under uncertainty with 0–1 integer first stage variables
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Introduction to Stochastic Programming
- Two‐stage stochastic integer programming: a survey
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- The stochastic generalised assignment problem with Bernoulli demands
