Computer ScienceMathematics

M. Desrochers, F. Soumis

1988INFOR

DOI: 10.1080/03155986.1988.11732063

tlooto Summary

An efficient generalized permanent labelling algorithm is presented based on the definition of the concept of a generalized bucket and on a specific order of handling the labels to solve the shortest path problem with time windows.

Abstract

Abstract is not available.

Citation format

DESROCHERS, M.; SOUMIS, F. A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR, 1988, 26: 191–212.