Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Roberto Montemanni, Luca Maria Gambardella, Alberto V. Donati. A branch and bound algorithm for the robust shortest path problem with interval data. Oper. Res. Lett., 32(3):225-232, 2004. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: An exact algorithm for the robust shortest path problem with interval dataRoberto Montemanni, Luca Maria Gambardella. cor, 31(10):1667-1680, 2004. [doi] A branch and bound algorithm for the robust spanning tree problem with interval dataRoberto Montemanni, Luca Maria Gambardella. eor, 161(3):771-779, 2005. [doi] The robust shortest path problem with interval data via Benders decompositionRoberto Montemanni, Luca Maria Gambardella. 4or, 3(4):315-328, 2005. [doi]
The following publications are possibly variants of this publication: