Exact solutions to a class of stochastic generalized assignment problems
From MaRDI portal
Publication:2496071
DOI10.1016/J.EJOR.2005.01.035zbMATH Open1113.90082OpenAlexW2070561923MaRDI QIDQ2496071FDOQ2496071
Authors: Maria Albareda-Sambola, Maarten H. van der Vlerk, Elena Fernández 
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
Recommendations
- Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
- The stochastic generalised assignment problem with Bernoulli demands
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- The bottleneck generalized assignment problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
Cites Work
- Title not available (Why is that?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A survey of algorithms for the generalized assignment problem
- Title not available (Why is that?)
- Models and exact solutions for a class of stochastic location-routing problems
- Dual decomposition in stochastic integer programming
- A branch-and-cut method for 0-1 mixed convex programming
- Title not available (Why is that?)
- Introduction to Stochastic Programming
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stochastic integer programming: general models and algorithms
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- 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
- Continuity Properties of Expectation Functions in Stochastic Integer Programming
- Two‐stage stochastic integer programming: a survey
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Two stage linear programming under uncertainty with 0–1 integer first stage variables
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- The stochastic generalised assignment problem with Bernoulli demands
- On optimal allocation of indivisibles under uncertainty
- Addressing capacity uncertainty in resource-constrained assignment problems
- R \& D planning and the generalized assignment problem
- Title not available (Why is that?)
Cited In (15)
- The stochastic programming heritage of Maarten van der Vlerk
- Improving the integer L-shaped method
- A branch-and-price approach for the stochastic generalized assignment problem
- On greedy approximation algorithms for a class of two-stage stochastic assignment problems
- Title not available (Why is that?)
- Supply capacity acquisition and allocation with uncertain customer demands
- The double exponential runtime is tight for 2-stage stochastic ILPs
- Scenario-based learning for stochastic combinatorial optimisation
- A Survey of the Generalized Assignment Problem and Its Applications
- The probabilistic travelling salesman problem with crowdsourcing
- The stochastic generalised assignment problem with Bernoulli demands
- The double exponential runtime is tight for 2-stage stochastic ILPs
- Probabilistic analysis of the generalised assignment problem
- The assignment of project managers to projects in an uncertain dynamic environment
- Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
Uses Software
This page was built for publication: Exact solutions to a class of stochastic generalized assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496071)
