In this paper, we study the Minimum Blocking Items Problem (MBIP) as a generalization of the Bounded Coloring Problem for Permutation Graphs and we motivate our interest by discussing some practical applications of MBIP to the context of minimizing reshuffle operations in a container yard. Then we present some results on the computational complexity of MBIP
Some Complexity Results for the Minimum Blocking Items Problem
Tiziano Bacci;Sara Mattia;Paolo Ventura
2017
Abstract
In this paper, we study the Minimum Blocking Items Problem (MBIP) as a generalization of the Bounded Coloring Problem for Permutation Graphs and we motivate our interest by discussing some practical applications of MBIP to the context of minimizing reshuffle operations in a container yard. Then we present some results on the computational complexity of MBIPFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
