PORTO @ 
Archivio Istituzionale della Ricerca
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThe Generalized Bin Packing Problem (GBPP) is a recently introduced packing problem where, given a set of bins characterized by volume and cost and a set of items characterized by volume and profit (which also depends on bins), we want to select a subset of items to be loaded into a subset of bins which maximizes the total net profit, while satisfying the volume and bin availability constraints. The total net profit is given by the difference between the total profit of the loaded items and the total cost of the used bins. In this paper, we consider the stochastic version of the GBPP (S-GBPP), where the item profits are random variables to take into account the profit oscillations due to the handling operations for bin loading. The probability distribution of these random variables is assumed to be unknown. By using the asymptotic theory of extreme values a deterministic approximation for the S-GBPP is derived.
The stochastic generalized bin packing problem / Perboli G.; Tadei R.; Baldi M. M.. - In: DISCRETE APPLIED MATHEMATICS. - ISSN 0166-218X. - STAMPA. - 160:7-8(2012), pp. 1291-1297.
| Titolo: | The stochastic generalized bin packing problem | |
| Autori: | ||
| Data di pubblicazione: | 2012 | |
| Rivista: | ||
| Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.dam.2011.10.037 | |
| Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| 2012_stochastic generalized bin packing.pdf | 2. Post-print / Author's Accepted Manuscript | Non Pubblico - Accesso privato/ristretto | Administrator Richiedi una copia | |
| 2428980.pdf | 1. Preprint / Submitted Version | PUBBLICO - Tutti i diritti riservati | Visibile a tuttiVisualizza/Apri |
http://hdl.handle.net/11583/2428980
Copyright © 2021