|edoc-Server der Humboldt-Universität zu Berlin|
Maria Albareda-Sambola, Universitat Politecnica de Catalunya|
Maarten H. van der Vlerk, University of Groningen
Elena Fernandez, Universitat Politecnica de Catalunya
|Title:||Exact solutions to a class of stochastic generalized assignment problems|
|Date of Acceptance:||22.04.2002|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Keywords (eng):||convex approximation, Generalized assignment, integer recourse|
|To appear in:||
European journal of operational research : EJOR |
North-Holland Publ. Co. (Amsterdam)
|Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.||Endnote Bibtex|
|This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment of each job to an agent is decided a priori, and once the demands are known, reassignments can be performed if there are overloaded agents. We construct a convex approximation of the objective function that is sharp at all feasible solutions. We then present three versions of an exact algorithm to solve this problem, based on branch and bound techniques, optimality cuts, and a special purpose lower bound. Numerical results are reported.|
These data concerning access statistics for individual documents
have been compiled using the webserver log files aggregated by AWSTATS.
They refer to a monthly access count to the full text documents as well as to the entry page.
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly.
To see the detailled access numbers please move the mouse pointer over the single bars of the digaram.
Gesamtzahl der Zugriffe seit May 2011: