The auction-reduction algorithm is a strongly polynomial version of the auction method for the shortest path problem. In this paper we extend the auction-reduction algorithm to diﬀerent types of shortest hyperpath problems in directed hypergraphs. The results of preliminary computational experiences show that the auction-reduction method is comparable to other known methods for speciﬁc classes of hypergraphs.
Auction algorithms for shortest hyperpath problems / R., DE LEONE; Pretolani, Daniele. - In: SIAM JOURNAL ON OPTIMIZATION. - ISSN 1052-6234. - STAMPA. - 11 (1):(2000), pp. 149-159. [10.1137/S1052623498343477]