Addressing capacity uncertainty in resource-constrained assignment problems
From MaRDI portal
Publication:2566939
DOI10.1016/j.cor.2004.07.015zbMath1088.90047OpenAlexW2090775737MaRDI QIDQ2566939
Berkin Toktaş, Joyce W. Yen, Zelda B. Zabinsky
Publication date: 29 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.07.015
generalized assignment problemapproximationassignment problemcapacity uncertaintyresource constraints
Related Items (5)
Supply capacity acquisition and allocation with uncertain customer demands ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ The common face of some 0/1-polytopes with NP-complete nonadjacency relation ⋮ Exact solutions to a class of stochastic generalized assignment problems ⋮ Addressing capacity uncertainty in resource-constrained assignment problems
Cites Work
- Unnamed Item
- Unnamed Item
- Addressing capacity uncertainty in resource-constrained assignment problems
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Resource-Constrained Assignment Scheduling
- An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
- A branch and bound algorithm for the generalized assignment problem
- Introduction to Stochastic Programming
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- The stochastic generalised assignment problem with Bernoulli demands
This page was built for publication: Addressing capacity uncertainty in resource-constrained assignment problems