We analyze a number of variations of a combinatorial optimization problem arising from the optimization of an automated warehouse. We classify these variations according to four relevant parameters and we analyze which combinations are polynomially solvable, owing to dynamic programming recursions or to reductions to known graph optimization problems such as the shortest path problem and the minimum cost perfect matching problem.
Paths and Matchings in an Automated Warehouse / M. Barbato, A. Ceselli, G. Righini (AIRO SPRINGER SERIES). - In: Advances in Optimization and Decision Science for Society, Services and Enterprises / [a cura di] M. Paolucci, A. Sciomachen, P. Uberti. - [s.l] : Springer, 2019. - ISBN 9783030349592. - pp. 151-159 (( convegno ODS tenutosi a Genova nel 2019 [10.1007/978-3-030-34960-8_14].
Paths and Matchings in an Automated Warehouse
M. Barbato;A. Ceselli;G. Righini
2019
Abstract
We analyze a number of variations of a combinatorial optimization problem arising from the optimization of an automated warehouse. We classify these variations according to four relevant parameters and we analyze which combinations are polynomially solvable, owing to dynamic programming recursions or to reductions to known graph optimization problems such as the shortest path problem and the minimum cost perfect matching problem.
| File | Dimensione | Formato | |
|---|---|---|---|
|
10.1007_978-3-030-34960-8.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
7.7 MB
Formato
Adobe PDF
|
7.7 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
